./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:09:28,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:09:28,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:09:28,184 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:09:28,185 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:09:28,205 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:09:28,206 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:09:28,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:09:28,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:09:28,207 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:09:28,207 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:09:28,207 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:09:28,207 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:09:28,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:09:28,208 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:09:28,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:09:28,208 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:09:28,208 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:09:28,209 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:09:28,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:09:28,209 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:09:28,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:09:28,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:09:28,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:09:28,217 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:09:28,217 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:09:28,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:09:28,217 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:09:28,217 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:09:28,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:09:28,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:09:28,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:09:28,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:09:28,220 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:09:28,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:09:28,221 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:09:28,221 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:09:28,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:09:28,221 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:09:28,221 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:09:28,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:09:28,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:09:28,222 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-11-11 16:09:28,440 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:09:28,461 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:09:28,464 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:09:28,465 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:09:28,465 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:09:28,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2024-11-11 16:09:29,804 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:09:30,072 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:09:30,074 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2024-11-11 16:09:30,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9abcf27a1/97029a6675d94f8fb3002a6099fab1e6/FLAG2ec117efa [2024-11-11 16:09:30,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9abcf27a1/97029a6675d94f8fb3002a6099fab1e6 [2024-11-11 16:09:30,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:09:30,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:09:30,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:09:30,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:09:30,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:09:30,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:30,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da5130a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30, skipping insertion in model container [2024-11-11 16:09:30,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:30,177 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:09:30,617 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label44.c[58121,58134] [2024-11-11 16:09:30,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:09:30,659 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:09:30,786 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label44.c[58121,58134] [2024-11-11 16:09:30,798 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:09:30,816 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:09:30,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30 WrapperNode [2024-11-11 16:09:30,816 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:09:30,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:09:30,817 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:09:30,817 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:09:30,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:30,849 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:30,907 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1772 [2024-11-11 16:09:30,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:09:30,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:09:30,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:09:30,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:09:30,921 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:30,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:30,930 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:30,965 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:09:30,965 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:30,965 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:30,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:31,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:31,017 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:31,023 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:31,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:09:31,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:09:31,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:09:31,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:09:31,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (1/1) ... [2024-11-11 16:09:31,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:09:31,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:09:31,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:09:31,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:09:31,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:09:31,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:09:31,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:09:31,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:09:31,176 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:09:31,178 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:09:32,571 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2024-11-11 16:09:32,571 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:09:32,586 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:09:32,586 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:09:32,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:09:32 BoogieIcfgContainer [2024-11-11 16:09:32,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:09:32,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:09:32,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:09:32,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:09:32,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:09:30" (1/3) ... [2024-11-11 16:09:32,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a581a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:09:32, skipping insertion in model container [2024-11-11 16:09:32,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:09:30" (2/3) ... [2024-11-11 16:09:32,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a581a1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:09:32, skipping insertion in model container [2024-11-11 16:09:32,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:09:32" (3/3) ... [2024-11-11 16:09:32,593 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem03_label44.c [2024-11-11 16:09:32,607 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:09:32,607 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:09:32,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:09:32,667 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;@7181b1f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:09:32,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:09:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-11 16:09:32,683 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:32,684 INFO L218 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, 1] [2024-11-11 16:09:32,685 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:32,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:32,690 INFO L85 PathProgramCache]: Analyzing trace with hash 302925243, now seen corresponding path program 1 times [2024-11-11 16:09:32,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:32,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853306077] [2024-11-11 16:09:32,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:32,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:33,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:09:33,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:33,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853306077] [2024-11-11 16:09:33,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853306077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:33,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:09:33,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714735927] [2024-11-11 16:09:33,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:33,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:33,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:33,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:33,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:33,409 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.73) internal successors, (519), 301 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:34,208 INFO L93 Difference]: Finished difference Result 855 states and 1496 transitions. [2024-11-11 16:09:34,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:34,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 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 177 [2024-11-11 16:09:34,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:34,225 INFO L225 Difference]: With dead ends: 855 [2024-11-11 16:09:34,226 INFO L226 Difference]: Without dead ends: 460 [2024-11-11 16:09:34,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:34,232 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 119 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 713 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:34,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 176 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 713 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:09:34,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-11 16:09:34,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 459. [2024-11-11 16:09:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.5502183406113537) internal successors, (710), 458 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 710 transitions. [2024-11-11 16:09:34,279 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 710 transitions. Word has length 177 [2024-11-11 16:09:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:34,280 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 710 transitions. [2024-11-11 16:09:34,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:34,280 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 710 transitions. [2024-11-11 16:09:34,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-11 16:09:34,287 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:34,287 INFO L218 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, 1] [2024-11-11 16:09:34,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:09:34,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:34,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:34,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2005485845, now seen corresponding path program 1 times [2024-11-11 16:09:34,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:34,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164961950] [2024-11-11 16:09:34,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:34,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:34,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:09:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164961950] [2024-11-11 16:09:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164961950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:34,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:34,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:09:34,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541519377] [2024-11-11 16:09:34,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:34,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:34,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:34,560 INFO L87 Difference]: Start difference. First operand 459 states and 710 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:35,216 INFO L93 Difference]: Finished difference Result 1342 states and 2082 transitions. [2024-11-11 16:09:35,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:35,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 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 182 [2024-11-11 16:09:35,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:35,220 INFO L225 Difference]: With dead ends: 1342 [2024-11-11 16:09:35,220 INFO L226 Difference]: Without dead ends: 885 [2024-11-11 16:09:35,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:35,222 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 251 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:35,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 181 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:09:35,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-11 16:09:35,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 880. [2024-11-11 16:09:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 879 states have (on average 1.4687144482366326) internal successors, (1291), 879 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1291 transitions. [2024-11-11 16:09:35,266 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1291 transitions. Word has length 182 [2024-11-11 16:09:35,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:35,267 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1291 transitions. [2024-11-11 16:09:35,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 2 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:35,268 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1291 transitions. [2024-11-11 16:09:35,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-11 16:09:35,271 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:35,271 INFO L218 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, 1] [2024-11-11 16:09:35,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:09:35,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:35,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:35,272 INFO L85 PathProgramCache]: Analyzing trace with hash -23446020, now seen corresponding path program 1 times [2024-11-11 16:09:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:35,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897291570] [2024-11-11 16:09:35,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:35,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:09:35,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897291570] [2024-11-11 16:09:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897291570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:35,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:35,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:09:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193073155] [2024-11-11 16:09:35,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:35,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:35,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:35,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:35,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:35,420 INFO L87 Difference]: Start difference. First operand 880 states and 1291 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:36,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:36,112 INFO L93 Difference]: Finished difference Result 2594 states and 3822 transitions. [2024-11-11 16:09:36,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:36,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 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 185 [2024-11-11 16:09:36,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:36,118 INFO L225 Difference]: With dead ends: 2594 [2024-11-11 16:09:36,118 INFO L226 Difference]: Without dead ends: 1716 [2024-11-11 16:09:36,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:36,120 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:36,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 90 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:09:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1716 states. [2024-11-11 16:09:36,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1716 to 1696. [2024-11-11 16:09:36,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1696 states, 1695 states have (on average 1.4395280235988202) internal successors, (2440), 1695 states have internal predecessors, (2440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 2440 transitions. [2024-11-11 16:09:36,146 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 2440 transitions. Word has length 185 [2024-11-11 16:09:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:36,146 INFO L471 AbstractCegarLoop]: Abstraction has 1696 states and 2440 transitions. [2024-11-11 16:09:36,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 2440 transitions. [2024-11-11 16:09:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-11 16:09:36,150 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:36,150 INFO L218 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, 1] [2024-11-11 16:09:36,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:09:36,150 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:36,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:36,151 INFO L85 PathProgramCache]: Analyzing trace with hash 372513201, now seen corresponding path program 1 times [2024-11-11 16:09:36,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:36,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994417485] [2024-11-11 16:09:36,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:36,668 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 16:09:36,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:36,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994417485] [2024-11-11 16:09:36,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994417485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:36,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:36,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:09:36,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166350396] [2024-11-11 16:09:36,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:36,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:09:36,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:36,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:09:36,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:09:36,672 INFO L87 Difference]: Start difference. First operand 1696 states and 2440 transitions. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:37,449 INFO L93 Difference]: Finished difference Result 3531 states and 5130 transitions. [2024-11-11 16:09:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:09:37,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 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 192 [2024-11-11 16:09:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:37,454 INFO L225 Difference]: With dead ends: 3531 [2024-11-11 16:09:37,455 INFO L226 Difference]: Without dead ends: 1663 [2024-11-11 16:09:37,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:09:37,458 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 331 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:37,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 47 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:09:37,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-11 16:09:37,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1663. [2024-11-11 16:09:37,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1663 states, 1662 states have (on average 1.325511432009627) internal successors, (2203), 1662 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:37,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1663 states to 1663 states and 2203 transitions. [2024-11-11 16:09:37,483 INFO L78 Accepts]: Start accepts. Automaton has 1663 states and 2203 transitions. Word has length 192 [2024-11-11 16:09:37,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:37,483 INFO L471 AbstractCegarLoop]: Abstraction has 1663 states and 2203 transitions. [2024-11-11 16:09:37,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 3 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:37,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1663 states and 2203 transitions. [2024-11-11 16:09:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-11 16:09:37,486 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:37,486 INFO L218 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, 1] [2024-11-11 16:09:37,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:09:37,487 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:37,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:37,488 INFO L85 PathProgramCache]: Analyzing trace with hash 146400972, now seen corresponding path program 1 times [2024-11-11 16:09:37,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:37,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740850611] [2024-11-11 16:09:37,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:37,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:38,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:09:38,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:38,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740850611] [2024-11-11 16:09:38,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740850611] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:38,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:38,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:09:38,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744885604] [2024-11-11 16:09:38,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:38,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:09:38,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:38,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:09:38,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:09:38,091 INFO L87 Difference]: Start difference. First operand 1663 states and 2203 transitions. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:38,978 INFO L93 Difference]: Finished difference Result 4323 states and 5743 transitions. [2024-11-11 16:09:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:09:38,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 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 208 [2024-11-11 16:09:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:38,986 INFO L225 Difference]: With dead ends: 4323 [2024-11-11 16:09:38,986 INFO L226 Difference]: Without dead ends: 2488 [2024-11-11 16:09:38,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:09:38,990 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 193 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 1206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:38,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 100 Invalid, 1206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:09:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2024-11-11 16:09:39,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2487. [2024-11-11 16:09:39,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2487 states, 2486 states have (on average 1.3085277554304102) internal successors, (3253), 2486 states have internal predecessors, (3253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2487 states to 2487 states and 3253 transitions. [2024-11-11 16:09:39,029 INFO L78 Accepts]: Start accepts. Automaton has 2487 states and 3253 transitions. Word has length 208 [2024-11-11 16:09:39,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:39,030 INFO L471 AbstractCegarLoop]: Abstraction has 2487 states and 3253 transitions. [2024-11-11 16:09:39,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:39,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2487 states and 3253 transitions. [2024-11-11 16:09:39,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-11 16:09:39,034 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:39,034 INFO L218 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, 1] [2024-11-11 16:09:39,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:09:39,035 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:39,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:39,035 INFO L85 PathProgramCache]: Analyzing trace with hash -459963951, now seen corresponding path program 1 times [2024-11-11 16:09:39,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:39,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042737405] [2024-11-11 16:09:39,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:39,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:39,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:39,253 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 16:09:39,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:39,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042737405] [2024-11-11 16:09:39,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042737405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:39,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:39,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:09:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495943180] [2024-11-11 16:09:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:39,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:39,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:39,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:39,257 INFO L87 Difference]: Start difference. First operand 2487 states and 3253 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:39,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:39,822 INFO L93 Difference]: Finished difference Result 6628 states and 8644 transitions. [2024-11-11 16:09:39,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:39,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 210 [2024-11-11 16:09:39,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:39,834 INFO L225 Difference]: With dead ends: 6628 [2024-11-11 16:09:39,834 INFO L226 Difference]: Without dead ends: 4143 [2024-11-11 16:09:39,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:39,840 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 202 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:39,840 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 117 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:09:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2024-11-11 16:09:39,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 4140. [2024-11-11 16:09:39,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4140 states, 4139 states have (on average 1.2974148345010872) internal successors, (5370), 4139 states have internal predecessors, (5370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:39,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5370 transitions. [2024-11-11 16:09:39,903 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 5370 transitions. Word has length 210 [2024-11-11 16:09:39,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:39,904 INFO L471 AbstractCegarLoop]: Abstraction has 4140 states and 5370 transitions. [2024-11-11 16:09:39,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:39,904 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 5370 transitions. [2024-11-11 16:09:39,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-11 16:09:39,913 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:39,913 INFO L218 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, 1] [2024-11-11 16:09:39,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:09:39,913 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:39,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:39,914 INFO L85 PathProgramCache]: Analyzing trace with hash -145510537, now seen corresponding path program 1 times [2024-11-11 16:09:39,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:39,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820640501] [2024-11-11 16:09:39,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:39,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:40,227 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:09:40,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:40,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820640501] [2024-11-11 16:09:40,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820640501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:09:40,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444438432] [2024-11-11 16:09:40,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:40,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:09:40,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:09:40,230 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:09:40,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:09:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:40,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:09:40,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:09:40,740 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-11 16:09:40,741 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:09:40,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444438432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:40,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:09:40,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-11 16:09:40,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934879061] [2024-11-11 16:09:40,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:40,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:40,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:40,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:40,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:09:40,743 INFO L87 Difference]: Start difference. First operand 4140 states and 5370 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:41,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:41,416 INFO L93 Difference]: Finished difference Result 8287 states and 10754 transitions. [2024-11-11 16:09:41,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:41,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 215 [2024-11-11 16:09:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:41,428 INFO L225 Difference]: With dead ends: 8287 [2024-11-11 16:09:41,429 INFO L226 Difference]: Without dead ends: 4149 [2024-11-11 16:09:41,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:09:41,437 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 47 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:41,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 320 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:09:41,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4149 states. [2024-11-11 16:09:41,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4149 to 4140. [2024-11-11 16:09:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4140 states, 4139 states have (on average 1.2867842474027542) internal successors, (5326), 4139 states have internal predecessors, (5326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:41,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4140 states to 4140 states and 5326 transitions. [2024-11-11 16:09:41,493 INFO L78 Accepts]: Start accepts. Automaton has 4140 states and 5326 transitions. Word has length 215 [2024-11-11 16:09:41,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:41,494 INFO L471 AbstractCegarLoop]: Abstraction has 4140 states and 5326 transitions. [2024-11-11 16:09:41,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:41,495 INFO L276 IsEmpty]: Start isEmpty. Operand 4140 states and 5326 transitions. [2024-11-11 16:09:41,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-11 16:09:41,501 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:41,501 INFO L218 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, 1] [2024-11-11 16:09:41,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 16:09:41,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:09:41,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:41,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:41,703 INFO L85 PathProgramCache]: Analyzing trace with hash -348387949, now seen corresponding path program 1 times [2024-11-11 16:09:41,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:41,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385864941] [2024-11-11 16:09:41,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:41,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:42,006 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-11 16:09:42,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:42,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385864941] [2024-11-11 16:09:42,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385864941] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:09:42,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414856974] [2024-11-11 16:09:42,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:42,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:09:42,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:09:42,008 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:09:42,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:09:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:42,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:09:42,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:09:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-11 16:09:42,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:09:42,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414856974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:42,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:09:42,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-11 16:09:42,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063661318] [2024-11-11 16:09:42,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:42,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:42,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:42,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:09:42,309 INFO L87 Difference]: Start difference. First operand 4140 states and 5326 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:42,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:42,869 INFO L93 Difference]: Finished difference Result 12344 states and 15880 transitions. [2024-11-11 16:09:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:42,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 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 221 [2024-11-11 16:09:42,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:42,893 INFO L225 Difference]: With dead ends: 12344 [2024-11-11 16:09:42,893 INFO L226 Difference]: Without dead ends: 8206 [2024-11-11 16:09:42,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:09:42,902 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 42 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:42,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 343 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:09:42,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8206 states. [2024-11-11 16:09:43,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8206 to 8200. [2024-11-11 16:09:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8200 states, 8199 states have (on average 1.17685083546774) internal successors, (9649), 8199 states have internal predecessors, (9649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8200 states to 8200 states and 9649 transitions. [2024-11-11 16:09:43,055 INFO L78 Accepts]: Start accepts. Automaton has 8200 states and 9649 transitions. Word has length 221 [2024-11-11 16:09:43,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:43,056 INFO L471 AbstractCegarLoop]: Abstraction has 8200 states and 9649 transitions. [2024-11-11 16:09:43,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:43,056 INFO L276 IsEmpty]: Start isEmpty. Operand 8200 states and 9649 transitions. [2024-11-11 16:09:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-11 16:09:43,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:43,068 INFO L218 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, 1] [2024-11-11 16:09:43,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 16:09:43,269 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,SelfDestructingSolverStorable7 [2024-11-11 16:09:43,269 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:43,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1029715779, now seen corresponding path program 1 times [2024-11-11 16:09:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:43,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549432704] [2024-11-11 16:09:43,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:43,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:09:43,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:43,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549432704] [2024-11-11 16:09:43,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549432704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:43,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:43,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:09:43,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662424407] [2024-11-11 16:09:43,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:43,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:43,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:43,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:43,458 INFO L87 Difference]: Start difference. First operand 8200 states and 9649 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:44,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:44,001 INFO L93 Difference]: Finished difference Result 20458 states and 24516 transitions. [2024-11-11 16:09:44,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:44,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 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 221 [2024-11-11 16:09:44,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:44,025 INFO L225 Difference]: With dead ends: 20458 [2024-11-11 16:09:44,025 INFO L226 Difference]: Without dead ends: 12260 [2024-11-11 16:09:44,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:44,037 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 173 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:44,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 126 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:09:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12260 states. [2024-11-11 16:09:44,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12260 to 12260. [2024-11-11 16:09:44,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12260 states, 12259 states have (on average 1.1425075454767926) internal successors, (14006), 12259 states have internal predecessors, (14006), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12260 states to 12260 states and 14006 transitions. [2024-11-11 16:09:44,220 INFO L78 Accepts]: Start accepts. Automaton has 12260 states and 14006 transitions. Word has length 221 [2024-11-11 16:09:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:44,221 INFO L471 AbstractCegarLoop]: Abstraction has 12260 states and 14006 transitions. [2024-11-11 16:09:44,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 12260 states and 14006 transitions. [2024-11-11 16:09:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2024-11-11 16:09:44,233 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:44,233 INFO L218 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, 1] [2024-11-11 16:09:44,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:09:44,234 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:44,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:44,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1383255126, now seen corresponding path program 1 times [2024-11-11 16:09:44,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:44,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270871110] [2024-11-11 16:09:44,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:44,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:44,417 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:09:44,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:44,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270871110] [2024-11-11 16:09:44,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270871110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:44,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:44,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:09:44,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878419637] [2024-11-11 16:09:44,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:44,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:44,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:44,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:44,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:44,419 INFO L87 Difference]: Start difference. First operand 12260 states and 14006 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-11-11 16:09:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:44,984 INFO L93 Difference]: Finished difference Result 35312 states and 40360 transitions. [2024-11-11 16:09:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:44,984 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 252 [2024-11-11 16:09:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:45,035 INFO L225 Difference]: With dead ends: 35312 [2024-11-11 16:09:45,035 INFO L226 Difference]: Without dead ends: 23054 [2024-11-11 16:09:45,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:45,049 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 156 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:45,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 109 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:09:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23054 states. [2024-11-11 16:09:45,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23054 to 18965. [2024-11-11 16:09:45,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18965 states, 18964 states have (on average 1.1550833157561695) internal successors, (21905), 18964 states have internal predecessors, (21905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:45,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18965 states to 18965 states and 21905 transitions. [2024-11-11 16:09:45,341 INFO L78 Accepts]: Start accepts. Automaton has 18965 states and 21905 transitions. Word has length 252 [2024-11-11 16:09:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:45,341 INFO L471 AbstractCegarLoop]: Abstraction has 18965 states and 21905 transitions. [2024-11-11 16:09:45,342 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-11-11 16:09:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 18965 states and 21905 transitions. [2024-11-11 16:09:45,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-11 16:09:45,365 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:45,366 INFO L218 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, 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-11-11 16:09:45,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:09:45,366 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:45,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1143032390, now seen corresponding path program 1 times [2024-11-11 16:09:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:45,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956914488] [2024-11-11 16:09:45,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:45,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:09:45,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:45,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956914488] [2024-11-11 16:09:45,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956914488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:45,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:45,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:09:45,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432895827] [2024-11-11 16:09:45,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:45,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:45,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:45,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:45,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:45,566 INFO L87 Difference]: Start difference. First operand 18965 states and 21905 transitions. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:46,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:46,141 INFO L93 Difference]: Finished difference Result 49526 states and 57380 transitions. [2024-11-11 16:09:46,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:46,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 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 273 [2024-11-11 16:09:46,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:46,182 INFO L225 Difference]: With dead ends: 49526 [2024-11-11 16:09:46,183 INFO L226 Difference]: Without dead ends: 30563 [2024-11-11 16:09:46,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:46,201 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 59 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:46,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 310 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:09:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30563 states. [2024-11-11 16:09:46,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30563 to 30554. [2024-11-11 16:09:46,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30554 states, 30553 states have (on average 1.1407390436291036) internal successors, (34853), 30553 states have internal predecessors, (34853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:46,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30554 states to 30554 states and 34853 transitions. [2024-11-11 16:09:46,524 INFO L78 Accepts]: Start accepts. Automaton has 30554 states and 34853 transitions. Word has length 273 [2024-11-11 16:09:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:46,525 INFO L471 AbstractCegarLoop]: Abstraction has 30554 states and 34853 transitions. [2024-11-11 16:09:46,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:46,525 INFO L276 IsEmpty]: Start isEmpty. Operand 30554 states and 34853 transitions. [2024-11-11 16:09:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2024-11-11 16:09:46,550 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:46,550 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-11 16:09:46,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:09:46,550 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:46,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:46,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1385401352, now seen corresponding path program 1 times [2024-11-11 16:09:46,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:46,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932696172] [2024-11-11 16:09:46,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:46,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-11 16:09:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932696172] [2024-11-11 16:09:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932696172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:09:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646706151] [2024-11-11 16:09:46,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:46,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:09:46,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:09:46,871 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:09:46,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 16:09:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:47,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 16:09:47,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:09:47,165 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 16:09:47,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:09:47,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646706151] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:47,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:09:47,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-11 16:09:47,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048149810] [2024-11-11 16:09:47,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:47,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:47,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:47,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:47,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:09:47,167 INFO L87 Difference]: Start difference. First operand 30554 states and 34853 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-11-11 16:09:47,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:47,719 INFO L93 Difference]: Finished difference Result 60909 states and 69507 transitions. [2024-11-11 16:09:47,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:47,720 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 285 [2024-11-11 16:09:47,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:47,757 INFO L225 Difference]: With dead ends: 60909 [2024-11-11 16:09:47,757 INFO L226 Difference]: Without dead ends: 30357 [2024-11-11 16:09:47,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:09:47,779 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 86 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:47,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 277 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:09:47,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30357 states. [2024-11-11 16:09:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30357 to 30148. [2024-11-11 16:09:48,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30148 states, 30147 states have (on average 1.1329817228911667) internal successors, (34156), 30147 states have internal predecessors, (34156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:48,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30148 states to 30148 states and 34156 transitions. [2024-11-11 16:09:48,148 INFO L78 Accepts]: Start accepts. Automaton has 30148 states and 34156 transitions. Word has length 285 [2024-11-11 16:09:48,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:48,148 INFO L471 AbstractCegarLoop]: Abstraction has 30148 states and 34156 transitions. [2024-11-11 16:09:48,149 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-11-11 16:09:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 30148 states and 34156 transitions. [2024-11-11 16:09:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2024-11-11 16:09:48,169 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:48,169 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-11 16:09:48,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 16:09:48,369 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-11-11 16:09:48,370 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:48,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1333397972, now seen corresponding path program 1 times [2024-11-11 16:09:48,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:48,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969622721] [2024-11-11 16:09:48,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:48,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:48,516 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 184 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 16:09:48,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:48,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969622721] [2024-11-11 16:09:48,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969622721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:48,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:48,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:09:48,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639557454] [2024-11-11 16:09:48,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:48,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:48,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:48,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:48,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:48,518 INFO L87 Difference]: Start difference. First operand 30148 states and 34156 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-11-11 16:09:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:49,156 INFO L93 Difference]: Finished difference Result 57629 states and 65157 transitions. [2024-11-11 16:09:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:49,157 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 326 [2024-11-11 16:09:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:49,187 INFO L225 Difference]: With dead ends: 57629 [2024-11-11 16:09:49,187 INFO L226 Difference]: Without dead ends: 27483 [2024-11-11 16:09:49,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:49,205 INFO L435 NwaCegarLoop]: 297 mSDtfsCounter, 224 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:49,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 312 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:09:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27483 states. [2024-11-11 16:09:49,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27483 to 27480. [2024-11-11 16:09:49,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27480 states, 27479 states have (on average 1.1036791731867972) internal successors, (30328), 27479 states have internal predecessors, (30328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27480 states to 27480 states and 30328 transitions. [2024-11-11 16:09:49,577 INFO L78 Accepts]: Start accepts. Automaton has 27480 states and 30328 transitions. Word has length 326 [2024-11-11 16:09:49,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:49,577 INFO L471 AbstractCegarLoop]: Abstraction has 27480 states and 30328 transitions. [2024-11-11 16:09:49,577 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-11-11 16:09:49,577 INFO L276 IsEmpty]: Start isEmpty. Operand 27480 states and 30328 transitions. [2024-11-11 16:09:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-11 16:09:49,602 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:49,602 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:09:49,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:09:49,603 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:49,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:49,603 INFO L85 PathProgramCache]: Analyzing trace with hash 302232853, now seen corresponding path program 1 times [2024-11-11 16:09:49,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:49,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010591509] [2024-11-11 16:09:49,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:49,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:50,084 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 212 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:09:50,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:50,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010591509] [2024-11-11 16:09:50,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010591509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:50,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:50,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:09:50,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772956012] [2024-11-11 16:09:50,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:50,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:09:50,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:50,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:09:50,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:09:50,086 INFO L87 Difference]: Start difference. First operand 27480 states and 30328 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-11-11 16:09:50,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:50,937 INFO L93 Difference]: Finished difference Result 64113 states and 70849 transitions. [2024-11-11 16:09:50,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:09:50,938 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 332 [2024-11-11 16:09:50,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:50,978 INFO L225 Difference]: With dead ends: 64113 [2024-11-11 16:09:50,978 INFO L226 Difference]: Without dead ends: 36635 [2024-11-11 16:09:50,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:09:50,996 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 412 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:50,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 77 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:09:51,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36635 states. [2024-11-11 16:09:51,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36635 to 36615. [2024-11-11 16:09:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36615 states, 36614 states have (on average 1.0838203965696183) internal successors, (39683), 36614 states have internal predecessors, (39683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:51,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36615 states to 36615 states and 39683 transitions. [2024-11-11 16:09:51,360 INFO L78 Accepts]: Start accepts. Automaton has 36615 states and 39683 transitions. Word has length 332 [2024-11-11 16:09:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:51,361 INFO L471 AbstractCegarLoop]: Abstraction has 36615 states and 39683 transitions. [2024-11-11 16:09:51,361 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-11-11 16:09:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 36615 states and 39683 transitions. [2024-11-11 16:09:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2024-11-11 16:09:51,388 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:51,388 INFO L218 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, 4, 4, 4, 4, 4, 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, 1, 1] [2024-11-11 16:09:51,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:09:51,388 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:51,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:51,389 INFO L85 PathProgramCache]: Analyzing trace with hash 49668228, now seen corresponding path program 1 times [2024-11-11 16:09:51,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:51,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737445676] [2024-11-11 16:09:51,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:51,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 131 proven. 6 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-11 16:09:51,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:51,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737445676] [2024-11-11 16:09:51,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737445676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:09:51,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428565260] [2024-11-11 16:09:51,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:51,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:09:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:09:51,689 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:09:51,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 16:09:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:51,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:09:51,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:09:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 271 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-11 16:09:51,931 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:09:51,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428565260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:51,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:09:51,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-11 16:09:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673327532] [2024-11-11 16:09:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:51,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:51,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:51,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:09:51,932 INFO L87 Difference]: Start difference. First operand 36615 states and 39683 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:52,522 INFO L93 Difference]: Finished difference Result 69792 states and 75611 transitions. [2024-11-11 16:09:52,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:09:52,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 342 [2024-11-11 16:09:52,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:52,558 INFO L225 Difference]: With dead ends: 69792 [2024-11-11 16:09:52,558 INFO L226 Difference]: Without dead ends: 33179 [2024-11-11 16:09:52,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 16:09:52,579 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 204 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:52,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 313 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:09:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33179 states. [2024-11-11 16:09:52,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33179 to 32146. [2024-11-11 16:09:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32146 states, 32145 states have (on average 1.079359153834189) internal successors, (34696), 32145 states have internal predecessors, (34696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:52,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32146 states to 32146 states and 34696 transitions. [2024-11-11 16:09:52,903 INFO L78 Accepts]: Start accepts. Automaton has 32146 states and 34696 transitions. Word has length 342 [2024-11-11 16:09:52,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:52,904 INFO L471 AbstractCegarLoop]: Abstraction has 32146 states and 34696 transitions. [2024-11-11 16:09:52,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:52,904 INFO L276 IsEmpty]: Start isEmpty. Operand 32146 states and 34696 transitions. [2024-11-11 16:09:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2024-11-11 16:09:52,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:52,928 INFO L218 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, 1] [2024-11-11 16:09:52,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 16:09:53,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 16:09:53,129 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:53,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:53,129 INFO L85 PathProgramCache]: Analyzing trace with hash 738662, now seen corresponding path program 1 times [2024-11-11 16:09:53,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:53,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14786205] [2024-11-11 16:09:53,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:53,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:53,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:53,469 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-11 16:09:53,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:53,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14786205] [2024-11-11 16:09:53,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14786205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:09:53,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508024558] [2024-11-11 16:09:53,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:53,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:09:53,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:09:53,472 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-11-11 16:09:53,473 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-11-11 16:09:53,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:53,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 16:09:53,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:09:53,696 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-11 16:09:53,696 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:09:53,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508024558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:53,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:09:53,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-11 16:09:53,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489482461] [2024-11-11 16:09:53,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:53,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:09:53,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:53,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:09:53,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:09:53,697 INFO L87 Difference]: Start difference. First operand 32146 states and 34696 transitions. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:54,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:54,426 INFO L93 Difference]: Finished difference Result 88682 states and 95711 transitions. [2024-11-11 16:09:54,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:09:54,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 361 [2024-11-11 16:09:54,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:54,491 INFO L225 Difference]: With dead ends: 88682 [2024-11-11 16:09:54,491 INFO L226 Difference]: Without dead ends: 56538 [2024-11-11 16:09:54,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 359 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-11-11 16:09:54,520 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 498 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:54,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 291 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:09:54,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56538 states. [2024-11-11 16:09:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56538 to 53284. [2024-11-11 16:09:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53284 states, 53283 states have (on average 1.0798753823921325) internal successors, (57539), 53283 states have internal predecessors, (57539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:55,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53284 states to 53284 states and 57539 transitions. [2024-11-11 16:09:55,315 INFO L78 Accepts]: Start accepts. Automaton has 53284 states and 57539 transitions. Word has length 361 [2024-11-11 16:09:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:55,315 INFO L471 AbstractCegarLoop]: Abstraction has 53284 states and 57539 transitions. [2024-11-11 16:09:55,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 3 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:55,316 INFO L276 IsEmpty]: Start isEmpty. Operand 53284 states and 57539 transitions. [2024-11-11 16:09:55,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2024-11-11 16:09:55,354 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:55,355 INFO L218 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, 1] [2024-11-11 16:09:55,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 16:09:55,555 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,SelfDestructingSolverStorable15 [2024-11-11 16:09:55,556 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:55,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:55,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1903494745, now seen corresponding path program 1 times [2024-11-11 16:09:55,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:55,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996516619] [2024-11-11 16:09:55,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:55,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-11 16:09:56,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:56,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996516619] [2024-11-11 16:09:56,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996516619] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:09:56,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382190607] [2024-11-11 16:09:56,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:56,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:09:56,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:09:56,130 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-11-11 16:09:56,131 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-11-11 16:09:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:56,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 16:09:56,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:09:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-11 16:09:56,469 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:09:56,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382190607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:56,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:09:56,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-11 16:09:56,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566712092] [2024-11-11 16:09:56,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:56,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:09:56,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:56,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:09:56,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-11 16:09:56,472 INFO L87 Difference]: Start difference. First operand 53284 states and 57539 transitions. Second operand has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:57,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:09:57,360 INFO L93 Difference]: Finished difference Result 145415 states and 157168 transitions. [2024-11-11 16:09:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:09:57,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 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 364 [2024-11-11 16:09:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:09:57,453 INFO L225 Difference]: With dead ends: 145415 [2024-11-11 16:09:57,453 INFO L226 Difference]: Without dead ends: 92133 [2024-11-11 16:09:57,496 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 362 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-11-11 16:09:57,496 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 467 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:09:57,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 443 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:09:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92133 states. [2024-11-11 16:09:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92133 to 91306. [2024-11-11 16:09:58,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91306 states, 91305 states have (on average 1.079327528612891) internal successors, (98548), 91305 states have internal predecessors, (98548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91306 states to 91306 states and 98548 transitions. [2024-11-11 16:09:58,891 INFO L78 Accepts]: Start accepts. Automaton has 91306 states and 98548 transitions. Word has length 364 [2024-11-11 16:09:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:09:58,892 INFO L471 AbstractCegarLoop]: Abstraction has 91306 states and 98548 transitions. [2024-11-11 16:09:58,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.25) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:09:58,892 INFO L276 IsEmpty]: Start isEmpty. Operand 91306 states and 98548 transitions. [2024-11-11 16:09:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-11 16:09:58,924 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:09:58,924 INFO L218 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, 1] [2024-11-11 16:09:58,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 16:09:59,124 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,SelfDestructingSolverStorable16 [2024-11-11 16:09:59,125 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:09:59,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:09:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash 397939553, now seen corresponding path program 1 times [2024-11-11 16:09:59,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:09:59,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713882642] [2024-11-11 16:09:59,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:09:59,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:09:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:09:59,309 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-11 16:09:59,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:09:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713882642] [2024-11-11 16:09:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713882642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:09:59,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:09:59,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:09:59,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968606239] [2024-11-11 16:09:59,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:09:59,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:09:59,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:09:59,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:09:59,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:09:59,311 INFO L87 Difference]: Start difference. First operand 91306 states and 98548 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:10:00,350 INFO L93 Difference]: Finished difference Result 176736 states and 190886 transitions. [2024-11-11 16:10:00,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:10:00,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 393 [2024-11-11 16:10:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:10:00,454 INFO L225 Difference]: With dead ends: 176736 [2024-11-11 16:10:00,454 INFO L226 Difference]: Without dead ends: 85432 [2024-11-11 16:10:00,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:10:00,700 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 149 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:10:00,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 108 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:10:00,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85432 states. [2024-11-11 16:10:01,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85432 to 75063. [2024-11-11 16:10:01,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75063 states, 75062 states have (on average 1.0660387413071861) internal successors, (80019), 75062 states have internal predecessors, (80019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75063 states to 75063 states and 80019 transitions. [2024-11-11 16:10:01,894 INFO L78 Accepts]: Start accepts. Automaton has 75063 states and 80019 transitions. Word has length 393 [2024-11-11 16:10:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:10:01,898 INFO L471 AbstractCegarLoop]: Abstraction has 75063 states and 80019 transitions. [2024-11-11 16:10:01,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 75063 states and 80019 transitions. [2024-11-11 16:10:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2024-11-11 16:10:01,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:10:01,933 INFO L218 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, 1] [2024-11-11 16:10:01,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 16:10:01,933 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:10:01,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:10:01,934 INFO L85 PathProgramCache]: Analyzing trace with hash -486924787, now seen corresponding path program 1 times [2024-11-11 16:10:01,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:10:01,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702119680] [2024-11-11 16:10:01,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:10:01,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:10:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:10:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 293 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2024-11-11 16:10:02,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:10:02,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702119680] [2024-11-11 16:10:02,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702119680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:10:02,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:10:02,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:10:02,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315724307] [2024-11-11 16:10:02,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:10:02,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:10:02,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:10:02,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:10:02,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:10:02,181 INFO L87 Difference]: Start difference. First operand 75063 states and 80019 transitions. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:10:02,996 INFO L93 Difference]: Finished difference Result 151743 states and 161472 transitions. [2024-11-11 16:10:02,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:10:02,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 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 393 [2024-11-11 16:10:02,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:10:03,095 INFO L225 Difference]: With dead ends: 151743 [2024-11-11 16:10:03,095 INFO L226 Difference]: Without dead ends: 76682 [2024-11-11 16:10:03,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:10:03,125 INFO L435 NwaCegarLoop]: 277 mSDtfsCounter, 212 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:10:03,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 292 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:10:03,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76682 states. [2024-11-11 16:10:04,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76682 to 73425. [2024-11-11 16:10:04,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73425 states, 73424 states have (on average 1.0488804750490304) internal successors, (77013), 73424 states have internal predecessors, (77013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73425 states to 73425 states and 77013 transitions. [2024-11-11 16:10:04,178 INFO L78 Accepts]: Start accepts. Automaton has 73425 states and 77013 transitions. Word has length 393 [2024-11-11 16:10:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:10:04,178 INFO L471 AbstractCegarLoop]: Abstraction has 73425 states and 77013 transitions. [2024-11-11 16:10:04,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 73425 states and 77013 transitions. [2024-11-11 16:10:04,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2024-11-11 16:10:04,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:10:04,204 INFO L218 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, 1] [2024-11-11 16:10:04,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 16:10:04,204 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:10:04,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:10:04,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1185805506, now seen corresponding path program 1 times [2024-11-11 16:10:04,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:10:04,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503629224] [2024-11-11 16:10:04,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:10:04,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:10:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:10:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2024-11-11 16:10:04,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:10:04,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503629224] [2024-11-11 16:10:04,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503629224] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:10:04,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:10:04,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:10:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034982492] [2024-11-11 16:10:04,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:10:04,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:10:04,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:10:04,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:10:04,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:10:04,574 INFO L87 Difference]: Start difference. First operand 73425 states and 77013 transitions. Second operand has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:05,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:10:05,621 INFO L93 Difference]: Finished difference Result 205777 states and 215326 transitions. [2024-11-11 16:10:05,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:10:05,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 398 [2024-11-11 16:10:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:10:05,782 INFO L225 Difference]: With dead ends: 205777 [2024-11-11 16:10:05,782 INFO L226 Difference]: Without dead ends: 128294 [2024-11-11 16:10:05,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:10:05,838 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 701 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 701 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:10:05,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [701 Valid, 290 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:10:05,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128294 states. [2024-11-11 16:10:07,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128294 to 119352. [2024-11-11 16:10:07,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119352 states, 119351 states have (on average 1.0475236906268066) internal successors, (125023), 119351 states have internal predecessors, (125023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119352 states to 119352 states and 125023 transitions. [2024-11-11 16:10:07,642 INFO L78 Accepts]: Start accepts. Automaton has 119352 states and 125023 transitions. Word has length 398 [2024-11-11 16:10:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:10:07,642 INFO L471 AbstractCegarLoop]: Abstraction has 119352 states and 125023 transitions. [2024-11-11 16:10:07,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.25) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 119352 states and 125023 transitions. [2024-11-11 16:10:07,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2024-11-11 16:10:07,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:10:07,659 INFO L218 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, 1] [2024-11-11 16:10:07,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 16:10:07,659 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:10:07,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:10:07,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1884846633, now seen corresponding path program 1 times [2024-11-11 16:10:07,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:10:07,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917834139] [2024-11-11 16:10:07,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:10:07,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:10:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:10:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2024-11-11 16:10:08,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:10:08,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917834139] [2024-11-11 16:10:08,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917834139] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:10:08,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:10:08,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:10:08,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942027475] [2024-11-11 16:10:08,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:10:08,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:10:08,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:10:08,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:10:08,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:10:08,091 INFO L87 Difference]: Start difference. First operand 119352 states and 125023 transitions. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:10:09,473 INFO L93 Difference]: Finished difference Result 350933 states and 367595 transitions. [2024-11-11 16:10:09,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:10:09,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 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 400 [2024-11-11 16:10:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:10:09,739 INFO L225 Difference]: With dead ends: 350933 [2024-11-11 16:10:09,740 INFO L226 Difference]: Without dead ends: 231786 [2024-11-11 16:10:09,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:10:09,779 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 185 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:10:09,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 485 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 16:10:09,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231786 states. [2024-11-11 16:10:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231786 to 230972. [2024-11-11 16:10:12,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230972 states, 230971 states have (on average 1.0474605036995988) internal successors, (241933), 230971 states have internal predecessors, (241933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230972 states to 230972 states and 241933 transitions. [2024-11-11 16:10:13,488 INFO L78 Accepts]: Start accepts. Automaton has 230972 states and 241933 transitions. Word has length 400 [2024-11-11 16:10:13,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:10:13,488 INFO L471 AbstractCegarLoop]: Abstraction has 230972 states and 241933 transitions. [2024-11-11 16:10:13,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 2 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:13,489 INFO L276 IsEmpty]: Start isEmpty. Operand 230972 states and 241933 transitions. [2024-11-11 16:10:13,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2024-11-11 16:10:13,516 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:10:13,516 INFO L218 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, 1] [2024-11-11 16:10:13,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 16:10:13,516 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:10:13,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:10:13,517 INFO L85 PathProgramCache]: Analyzing trace with hash -792061351, now seen corresponding path program 1 times [2024-11-11 16:10:13,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:10:13,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033462718] [2024-11-11 16:10:13,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:10:13,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:10:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:10:13,848 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-11 16:10:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:10:13,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033462718] [2024-11-11 16:10:13,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033462718] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:10:13,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:10:13,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:10:13,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066129575] [2024-11-11 16:10:13,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:10:13,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:10:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:10:13,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:10:13,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:10:13,849 INFO L87 Difference]: Start difference. First operand 230972 states and 241933 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:10:15,828 INFO L93 Difference]: Finished difference Result 485728 states and 508507 transitions. [2024-11-11 16:10:15,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:10:15,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 400 [2024-11-11 16:10:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:10:16,204 INFO L225 Difference]: With dead ends: 485728 [2024-11-11 16:10:16,204 INFO L226 Difference]: Without dead ends: 254961 [2024-11-11 16:10:16,325 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:10:16,326 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 162 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:10:16,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 316 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:10:16,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254961 states. [2024-11-11 16:10:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254961 to 254317. [2024-11-11 16:10:19,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254317 states, 254316 states have (on average 1.0439335315119773) internal successors, (265489), 254316 states have internal predecessors, (265489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:20,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254317 states to 254317 states and 265489 transitions. [2024-11-11 16:10:20,250 INFO L78 Accepts]: Start accepts. Automaton has 254317 states and 265489 transitions. Word has length 400 [2024-11-11 16:10:20,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:10:20,250 INFO L471 AbstractCegarLoop]: Abstraction has 254317 states and 265489 transitions. [2024-11-11 16:10:20,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:20,251 INFO L276 IsEmpty]: Start isEmpty. Operand 254317 states and 265489 transitions. [2024-11-11 16:10:20,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2024-11-11 16:10:20,788 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:10:20,789 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:10:20,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 16:10:20,789 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:10:20,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:10:20,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1777016498, now seen corresponding path program 1 times [2024-11-11 16:10:20,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:10:20,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130917509] [2024-11-11 16:10:20,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:10:20,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:10:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:10:21,306 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-11-11 16:10:21,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:10:21,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130917509] [2024-11-11 16:10:21,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130917509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:10:21,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:10:21,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:10:21,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950805631] [2024-11-11 16:10:21,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:10:21,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:10:21,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:10:21,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:10:21,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:10:21,308 INFO L87 Difference]: Start difference. First operand 254317 states and 265489 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:10:23,287 INFO L93 Difference]: Finished difference Result 509038 states and 531289 transitions. [2024-11-11 16:10:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:10:23,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 415 [2024-11-11 16:10:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:10:23,648 INFO L225 Difference]: With dead ends: 509038 [2024-11-11 16:10:23,648 INFO L226 Difference]: Without dead ends: 254926 [2024-11-11 16:10:23,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:10:23,825 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 423 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:10:23,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 324 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:10:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254926 states. [2024-11-11 16:10:27,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254926 to 244368. [2024-11-11 16:10:27,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244368 states, 244367 states have (on average 1.0444740902003953) internal successors, (255235), 244367 states have internal predecessors, (255235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:28,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244368 states to 244368 states and 255235 transitions. [2024-11-11 16:10:28,043 INFO L78 Accepts]: Start accepts. Automaton has 244368 states and 255235 transitions. Word has length 415 [2024-11-11 16:10:28,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:10:28,043 INFO L471 AbstractCegarLoop]: Abstraction has 244368 states and 255235 transitions. [2024-11-11 16:10:28,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:10:28,044 INFO L276 IsEmpty]: Start isEmpty. Operand 244368 states and 255235 transitions. [2024-11-11 16:10:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2024-11-11 16:10:28,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:10:28,081 INFO L218 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:10:28,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-11 16:10:28,082 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:10:28,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:10:28,082 INFO L85 PathProgramCache]: Analyzing trace with hash 365271734, now seen corresponding path program 1 times [2024-11-11 16:10:28,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:10:28,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876518649] [2024-11-11 16:10:28,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:10:28,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:10:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:10:28,503 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-11 16:10:28,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:10:28,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876518649] [2024-11-11 16:10:28,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876518649] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:10:28,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:10:28,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:10:28,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560570212] [2024-11-11 16:10:28,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:10:28,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:10:28,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:10:28,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:10:28,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:10:28,505 INFO L87 Difference]: Start difference. First operand 244368 states and 255235 transitions. Second operand has 4 states, 4 states have (on average 75.25) 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)