./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label17.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 42b374d0017cdae74eebab609ba5393370e8c987522e66a98f57a11c3f33505a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-13 23:45:52,387 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 23:45:52,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 23:45:52,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 23:45:52,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 23:45:52,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 23:45:52,475 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 23:45:52,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 23:45:52,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 23:45:52,479 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 23:45:52,479 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 23:45:52,479 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 23:45:52,480 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 23:45:52,480 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 23:45:52,480 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 23:45:52,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 23:45:52,480 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 23:45:52,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 23:45:52,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 23:45:52,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 23:45:52,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 23:45:52,482 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 23:45:52,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 23:45:52,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 23:45:52,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 23:45:52,483 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 23:45:52,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 23:45:52,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 23:45:52,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 23:45:52,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 23:45:52,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 23:45:52,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 23:45:52,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:45:52,484 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 23:45:52,484 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 23:45:52,484 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 23:45:52,484 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 23:45:52,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 23:45:52,485 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 23:45:52,485 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 23:45:52,485 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 23:45:52,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 23:45:52,486 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 -> 42b374d0017cdae74eebab609ba5393370e8c987522e66a98f57a11c3f33505a [2024-10-13 23:45:52,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 23:45:52,705 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 23:45:52,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 23:45:52,708 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 23:45:52,708 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 23:45:52,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label17.c [2024-10-13 23:45:53,883 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 23:45:54,165 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 23:45:54,169 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label17.c [2024-10-13 23:45:54,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33086b993/4fe40cf3fbe14665b1faa0dc056cabe0/FLAGbc7bfbccf [2024-10-13 23:45:54,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33086b993/4fe40cf3fbe14665b1faa0dc056cabe0 [2024-10-13 23:45:54,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 23:45:54,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 23:45:54,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 23:45:54,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 23:45:54,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 23:45:54,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:54,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe197a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54, skipping insertion in model container [2024-10-13 23:45:54,205 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:54,259 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 23:45:54,441 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label17.c[7664,7677] [2024-10-13 23:45:54,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:45:54,720 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 23:45:54,747 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label17.c[7664,7677] [2024-10-13 23:45:54,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 23:45:54,959 INFO L204 MainTranslator]: Completed translation [2024-10-13 23:45:54,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54 WrapperNode [2024-10-13 23:45:54,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 23:45:54,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 23:45:54,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 23:45:54,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 23:45:54,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:54,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,084 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-10-13 23:45:55,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 23:45:55,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 23:45:55,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 23:45:55,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 23:45:55,093 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,231 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 23:45:55,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,342 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 23:45:55,363 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 23:45:55,364 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 23:45:55,364 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 23:45:55,364 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (1/1) ... [2024-10-13 23:45:55,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 23:45:55,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:45:55,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 23:45:55,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 23:45:55,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 23:45:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 23:45:55,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 23:45:55,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 23:45:55,473 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 23:45:55,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 23:45:57,113 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-10-13 23:45:57,113 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 23:45:57,150 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 23:45:57,152 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 23:45:57,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:45:57 BoogieIcfgContainer [2024-10-13 23:45:57,153 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 23:45:57,154 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 23:45:57,154 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 23:45:57,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 23:45:57,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:45:54" (1/3) ... [2024-10-13 23:45:57,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7516ac06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:45:57, skipping insertion in model container [2024-10-13 23:45:57,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:45:54" (2/3) ... [2024-10-13 23:45:57,157 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7516ac06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:45:57, skipping insertion in model container [2024-10-13 23:45:57,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:45:57" (3/3) ... [2024-10-13 23:45:57,158 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label17.c [2024-10-13 23:45:57,170 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 23:45:57,170 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 23:45:57,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 23:45:57,237 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;@6789b69a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 23:45:57,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 23:45:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:45:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 23:45:57,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:57,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:57,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:57,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1845176167, now seen corresponding path program 1 times [2024-10-13 23:45:57,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:57,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016469106] [2024-10-13 23:45:57,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:57,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:57,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:45:57,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:57,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016469106] [2024-10-13 23:45:57,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016469106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:57,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:57,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:45:57,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882265210] [2024-10-13 23:45:57,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:57,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 23:45:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:57,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 23:45:57,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:45:57,424 INFO L87 Difference]: Start difference. First operand has 362 states, 360 states have (on average 1.9111111111111112) internal successors, (688), 361 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:45:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:57,464 INFO L93 Difference]: Finished difference Result 723 states and 1375 transitions. [2024-10-13 23:45:57,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 23:45:57,466 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-13 23:45:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:57,474 INFO L225 Difference]: With dead ends: 723 [2024-10-13 23:45:57,474 INFO L226 Difference]: Without dead ends: 360 [2024-10-13 23:45:57,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 23:45:57,479 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:57,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 623 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 23:45:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-10-13 23:45:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2024-10-13 23:45:57,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 359 states have (on average 1.7353760445682451) internal successors, (623), 359 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:45:57,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 623 transitions. [2024-10-13 23:45:57,517 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 623 transitions. Word has length 62 [2024-10-13 23:45:57,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:57,517 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 623 transitions. [2024-10-13 23:45:57,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:45:57,518 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 623 transitions. [2024-10-13 23:45:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-13 23:45:57,519 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:57,519 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:57,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 23:45:57,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:57,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:57,520 INFO L85 PathProgramCache]: Analyzing trace with hash 974780075, now seen corresponding path program 1 times [2024-10-13 23:45:57,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:57,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648895839] [2024-10-13 23:45:57,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:57,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:45:57,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:57,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648895839] [2024-10-13 23:45:57,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648895839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:57,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:57,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:45:57,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966985767] [2024-10-13 23:45:57,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:57,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:45:57,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:57,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:45:57,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:45:57,706 INFO L87 Difference]: Start difference. First operand 360 states and 623 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:45:59,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:45:59,126 INFO L93 Difference]: Finished difference Result 1046 states and 1824 transitions. [2024-10-13 23:45:59,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:45:59,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2024-10-13 23:45:59,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:45:59,129 INFO L225 Difference]: With dead ends: 1046 [2024-10-13 23:45:59,130 INFO L226 Difference]: Without dead ends: 687 [2024-10-13 23:45:59,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:45:59,131 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 274 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:45:59,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 193 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:45:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-10-13 23:45:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 679. [2024-10-13 23:45:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 678 states have (on average 1.6106194690265487) internal successors, (1092), 678 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:45:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1092 transitions. [2024-10-13 23:45:59,157 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1092 transitions. Word has length 62 [2024-10-13 23:45:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:45:59,157 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1092 transitions. [2024-10-13 23:45:59,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:45:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1092 transitions. [2024-10-13 23:45:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 23:45:59,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:45:59,161 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:45:59,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 23:45:59,161 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:45:59,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:45:59,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1648054715, now seen corresponding path program 1 times [2024-10-13 23:45:59,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:45:59,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913176556] [2024-10-13 23:45:59,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:45:59,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:45:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:45:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:45:59,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:45:59,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913176556] [2024-10-13 23:45:59,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913176556] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:45:59,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:45:59,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:45:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639703665] [2024-10-13 23:45:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:45:59,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:45:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:45:59,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:45:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:45:59,313 INFO L87 Difference]: Start difference. First operand 679 states and 1092 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:00,426 INFO L93 Difference]: Finished difference Result 1963 states and 3170 transitions. [2024-10-13 23:46:00,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:00,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 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 130 [2024-10-13 23:46:00,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:00,432 INFO L225 Difference]: With dead ends: 1963 [2024-10-13 23:46:00,432 INFO L226 Difference]: Without dead ends: 1285 [2024-10-13 23:46:00,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:00,435 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 282 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:00,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 358 Invalid, 1098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:46:00,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2024-10-13 23:46:00,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1280. [2024-10-13 23:46:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1279 states have (on average 1.3956215793588742) internal successors, (1785), 1279 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:00,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1785 transitions. [2024-10-13 23:46:00,460 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1785 transitions. Word has length 130 [2024-10-13 23:46:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:00,461 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1785 transitions. [2024-10-13 23:46:00,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 2 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1785 transitions. [2024-10-13 23:46:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-13 23:46:00,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:00,466 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:00,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 23:46:00,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:00,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:00,470 INFO L85 PathProgramCache]: Analyzing trace with hash -2000410545, now seen corresponding path program 1 times [2024-10-13 23:46:00,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:00,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498835497] [2024-10-13 23:46:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:00,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:00,801 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:00,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:00,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498835497] [2024-10-13 23:46:00,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498835497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:00,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:00,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:46:00,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369427769] [2024-10-13 23:46:00,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:00,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:00,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:00,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:00,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:00,804 INFO L87 Difference]: Start difference. First operand 1280 states and 1785 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:01,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:01,823 INFO L93 Difference]: Finished difference Result 2858 states and 3904 transitions. [2024-10-13 23:46:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:01,823 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2024-10-13 23:46:01,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:01,828 INFO L225 Difference]: With dead ends: 2858 [2024-10-13 23:46:01,828 INFO L226 Difference]: Without dead ends: 1579 [2024-10-13 23:46:01,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:01,830 INFO L432 NwaCegarLoop]: 322 mSDtfsCounter, 225 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:01,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 357 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 889 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:46:01,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2024-10-13 23:46:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1579. [2024-10-13 23:46:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1579 states, 1578 states have (on average 1.3244613434727504) internal successors, (2090), 1578 states have internal predecessors, (2090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1579 states to 1579 states and 2090 transitions. [2024-10-13 23:46:01,849 INFO L78 Accepts]: Start accepts. Automaton has 1579 states and 2090 transitions. Word has length 138 [2024-10-13 23:46:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:01,849 INFO L471 AbstractCegarLoop]: Abstraction has 1579 states and 2090 transitions. [2024-10-13 23:46:01,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1579 states and 2090 transitions. [2024-10-13 23:46:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-10-13 23:46:01,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:01,852 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:01,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 23:46:01,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:01,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:01,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1413902896, now seen corresponding path program 1 times [2024-10-13 23:46:01,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:01,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891135007] [2024-10-13 23:46:01,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:01,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:01,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:02,007 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-10-13 23:46:02,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:02,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891135007] [2024-10-13 23:46:02,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891135007] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:02,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:02,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:02,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278199347] [2024-10-13 23:46:02,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:02,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:02,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:02,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:02,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:02,012 INFO L87 Difference]: Start difference. First operand 1579 states and 2090 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:03,149 INFO L93 Difference]: Finished difference Result 4064 states and 5550 transitions. [2024-10-13 23:46:03,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:03,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2024-10-13 23:46:03,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:03,155 INFO L225 Difference]: With dead ends: 4064 [2024-10-13 23:46:03,156 INFO L226 Difference]: Without dead ends: 2785 [2024-10-13 23:46:03,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:03,158 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 265 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:03,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 634 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:46:03,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2785 states. [2024-10-13 23:46:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2785 to 2785. [2024-10-13 23:46:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2785 states, 2784 states have (on average 1.2205459770114941) internal successors, (3398), 2784 states have internal predecessors, (3398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2785 states to 2785 states and 3398 transitions. [2024-10-13 23:46:03,184 INFO L78 Accepts]: Start accepts. Automaton has 2785 states and 3398 transitions. Word has length 229 [2024-10-13 23:46:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:03,184 INFO L471 AbstractCegarLoop]: Abstraction has 2785 states and 3398 transitions. [2024-10-13 23:46:03,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:03,185 INFO L276 IsEmpty]: Start isEmpty. Operand 2785 states and 3398 transitions. [2024-10-13 23:46:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2024-10-13 23:46:03,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:03,187 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:03,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 23:46:03,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:03,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash 300759004, now seen corresponding path program 1 times [2024-10-13 23:46:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:03,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776855356] [2024-10-13 23:46:03,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:03,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:03,367 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-10-13 23:46:03,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:03,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776855356] [2024-10-13 23:46:03,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776855356] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:03,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:03,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 23:46:03,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360141859] [2024-10-13 23:46:03,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:03,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:03,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:03,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:03,368 INFO L87 Difference]: Start difference. First operand 2785 states and 3398 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:05,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:05,072 INFO L93 Difference]: Finished difference Result 6471 states and 8163 transitions. [2024-10-13 23:46:05,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:05,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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 235 [2024-10-13 23:46:05,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:05,083 INFO L225 Difference]: With dead ends: 6471 [2024-10-13 23:46:05,084 INFO L226 Difference]: Without dead ends: 3986 [2024-10-13 23:46:05,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:05,087 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 220 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 276 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 276 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:05,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 362 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [276 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-13 23:46:05,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2024-10-13 23:46:05,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3685. [2024-10-13 23:46:05,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3685 states, 3684 states have (on average 1.1959826275787189) internal successors, (4406), 3684 states have internal predecessors, (4406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4406 transitions. [2024-10-13 23:46:05,128 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4406 transitions. Word has length 235 [2024-10-13 23:46:05,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:05,129 INFO L471 AbstractCegarLoop]: Abstraction has 3685 states and 4406 transitions. [2024-10-13 23:46:05,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4406 transitions. [2024-10-13 23:46:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2024-10-13 23:46:05,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:05,132 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:05,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 23:46:05,132 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:05,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:05,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2109130330, now seen corresponding path program 1 times [2024-10-13 23:46:05,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:05,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303886406] [2024-10-13 23:46:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:05,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:05,406 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:05,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:05,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303886406] [2024-10-13 23:46:05,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303886406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:05,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:05,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:05,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542054313] [2024-10-13 23:46:05,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:05,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:05,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:05,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:05,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:05,409 INFO L87 Difference]: Start difference. First operand 3685 states and 4406 transitions. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:06,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:06,566 INFO L93 Difference]: Finished difference Result 8278 states and 10189 transitions. [2024-10-13 23:46:06,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:06,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 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 344 [2024-10-13 23:46:06,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:06,579 INFO L225 Difference]: With dead ends: 8278 [2024-10-13 23:46:06,579 INFO L226 Difference]: Without dead ends: 4893 [2024-10-13 23:46:06,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:06,585 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 267 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:06,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 600 Invalid, 1128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:46:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2024-10-13 23:46:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4591. [2024-10-13 23:46:06,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4591 states, 4590 states have (on average 1.1840958605664489) internal successors, (5435), 4590 states have internal predecessors, (5435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:06,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4591 states to 4591 states and 5435 transitions. [2024-10-13 23:46:06,638 INFO L78 Accepts]: Start accepts. Automaton has 4591 states and 5435 transitions. Word has length 344 [2024-10-13 23:46:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:06,639 INFO L471 AbstractCegarLoop]: Abstraction has 4591 states and 5435 transitions. [2024-10-13 23:46:06,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:06,639 INFO L276 IsEmpty]: Start isEmpty. Operand 4591 states and 5435 transitions. [2024-10-13 23:46:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2024-10-13 23:46:06,642 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:06,642 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:06,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 23:46:06,642 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:06,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2070403493, now seen corresponding path program 1 times [2024-10-13 23:46:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282063221] [2024-10-13 23:46:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 23:46:06,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:06,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282063221] [2024-10-13 23:46:06,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282063221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:06,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:06,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:06,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843720718] [2024-10-13 23:46:06,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:06,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:06,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:06,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:06,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:06,906 INFO L87 Difference]: Start difference. First operand 4591 states and 5435 transitions. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:07,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:07,947 INFO L93 Difference]: Finished difference Result 10078 states and 12233 transitions. [2024-10-13 23:46:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2024-10-13 23:46:07,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:07,963 INFO L225 Difference]: With dead ends: 10078 [2024-10-13 23:46:07,963 INFO L226 Difference]: Without dead ends: 5787 [2024-10-13 23:46:07,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:07,969 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 265 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:07,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 616 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:46:07,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5787 states. [2024-10-13 23:46:08,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5787 to 5783. [2024-10-13 23:46:08,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5783 states, 5782 states have (on average 1.166378415773089) internal successors, (6744), 5782 states have internal predecessors, (6744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:08,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 6744 transitions. [2024-10-13 23:46:08,029 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 6744 transitions. Word has length 349 [2024-10-13 23:46:08,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:08,029 INFO L471 AbstractCegarLoop]: Abstraction has 5783 states and 6744 transitions. [2024-10-13 23:46:08,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:08,029 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 6744 transitions. [2024-10-13 23:46:08,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2024-10-13 23:46:08,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:08,036 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:08,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 23:46:08,036 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:08,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:08,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1984567859, now seen corresponding path program 1 times [2024-10-13 23:46:08,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:08,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902970811] [2024-10-13 23:46:08,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:08,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:08,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 426 proven. 39 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-10-13 23:46:08,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:08,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902970811] [2024-10-13 23:46:08,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902970811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:08,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382016427] [2024-10-13 23:46:08,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:08,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:08,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:08,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:46:08,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 23:46:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:08,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:46:08,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:09,061 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 375 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-13 23:46:09,061 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:46:09,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382016427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:09,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:46:09,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:46:09,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542856800] [2024-10-13 23:46:09,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:09,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:09,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:09,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:46:09,066 INFO L87 Difference]: Start difference. First operand 5783 states and 6744 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:10,172 INFO L93 Difference]: Finished difference Result 14555 states and 17043 transitions. [2024-10-13 23:46:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:10,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 513 [2024-10-13 23:46:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:10,193 INFO L225 Difference]: With dead ends: 14555 [2024-10-13 23:46:10,193 INFO L226 Difference]: Without dead ends: 9072 [2024-10-13 23:46:10,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 512 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:46:10,199 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 147 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 906 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 1112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:10,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 313 Invalid, 1112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 906 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:46:10,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9072 states. [2024-10-13 23:46:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9072 to 7577. [2024-10-13 23:46:10,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7577 states, 7576 states have (on average 1.148363252375924) internal successors, (8700), 7576 states have internal predecessors, (8700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:10,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7577 states to 7577 states and 8700 transitions. [2024-10-13 23:46:10,316 INFO L78 Accepts]: Start accepts. Automaton has 7577 states and 8700 transitions. Word has length 513 [2024-10-13 23:46:10,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:10,317 INFO L471 AbstractCegarLoop]: Abstraction has 7577 states and 8700 transitions. [2024-10-13 23:46:10,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:10,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7577 states and 8700 transitions. [2024-10-13 23:46:10,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2024-10-13 23:46:10,324 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:10,324 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:10,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 23:46:10,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:10,529 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:10,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1801150884, now seen corresponding path program 1 times [2024-10-13 23:46:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:10,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085851078] [2024-10-13 23:46:10,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:10,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 531 proven. 39 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2024-10-13 23:46:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085851078] [2024-10-13 23:46:11,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085851078] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:11,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732649162] [2024-10-13 23:46:11,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:11,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:11,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:11,025 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:46:11,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 23:46:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:11,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 677 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:46:11,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:11,235 INFO L134 CoverageAnalysis]: Checked inductivity of 767 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-13 23:46:11,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:46:11,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732649162] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:11,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:46:11,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:46:11,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435136549] [2024-10-13 23:46:11,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:11,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:11,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:11,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:11,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:46:11,238 INFO L87 Difference]: Start difference. First operand 7577 states and 8700 transitions. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:12,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:12,410 INFO L93 Difference]: Finished difference Result 17245 states and 20050 transitions. [2024-10-13 23:46:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:12,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 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 546 [2024-10-13 23:46:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:12,422 INFO L225 Difference]: With dead ends: 17245 [2024-10-13 23:46:12,423 INFO L226 Difference]: Without dead ends: 9968 [2024-10-13 23:46:12,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:46:12,429 INFO L432 NwaCegarLoop]: 425 mSDtfsCounter, 354 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:12,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 444 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:46:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9968 states. [2024-10-13 23:46:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9968 to 9968. [2024-10-13 23:46:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9968 states, 9967 states have (on average 1.1498946523527642) internal successors, (11461), 9967 states have internal predecessors, (11461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:12,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9968 states to 9968 states and 11461 transitions. [2024-10-13 23:46:12,537 INFO L78 Accepts]: Start accepts. Automaton has 9968 states and 11461 transitions. Word has length 546 [2024-10-13 23:46:12,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:12,537 INFO L471 AbstractCegarLoop]: Abstraction has 9968 states and 11461 transitions. [2024-10-13 23:46:12,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:12,538 INFO L276 IsEmpty]: Start isEmpty. Operand 9968 states and 11461 transitions. [2024-10-13 23:46:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2024-10-13 23:46:12,541 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:12,542 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:12,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 23:46:12,743 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,SelfDestructingSolverStorable9 [2024-10-13 23:46:12,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:12,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash 660035886, now seen corresponding path program 1 times [2024-10-13 23:46:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:12,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579605061] [2024-10-13 23:46:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:13,137 INFO L134 CoverageAnalysis]: Checked inductivity of 779 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2024-10-13 23:46:13,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:13,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579605061] [2024-10-13 23:46:13,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579605061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:13,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:13,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:13,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948658871] [2024-10-13 23:46:13,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:13,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:13,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:13,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:13,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:13,140 INFO L87 Difference]: Start difference. First operand 9968 states and 11461 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:14,331 INFO L93 Difference]: Finished difference Result 24135 states and 27999 transitions. [2024-10-13 23:46:14,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:14,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 550 [2024-10-13 23:46:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:14,349 INFO L225 Difference]: With dead ends: 24135 [2024-10-13 23:46:14,349 INFO L226 Difference]: Without dead ends: 14467 [2024-10-13 23:46:14,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:14,359 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 246 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:14,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 618 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 23:46:14,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14467 states. [2024-10-13 23:46:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14467 to 14157. [2024-10-13 23:46:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14157 states, 14156 states have (on average 1.1347838372421588) internal successors, (16064), 14156 states have internal predecessors, (16064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14157 states to 14157 states and 16064 transitions. [2024-10-13 23:46:14,484 INFO L78 Accepts]: Start accepts. Automaton has 14157 states and 16064 transitions. Word has length 550 [2024-10-13 23:46:14,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:14,486 INFO L471 AbstractCegarLoop]: Abstraction has 14157 states and 16064 transitions. [2024-10-13 23:46:14,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:14,486 INFO L276 IsEmpty]: Start isEmpty. Operand 14157 states and 16064 transitions. [2024-10-13 23:46:14,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2024-10-13 23:46:14,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:14,493 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:14,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 23:46:14,493 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:14,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:14,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1016252306, now seen corresponding path program 1 times [2024-10-13 23:46:14,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:14,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170785874] [2024-10-13 23:46:14,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:14,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 688 proven. 39 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2024-10-13 23:46:14,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:14,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170785874] [2024-10-13 23:46:14,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170785874] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:14,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618305365] [2024-10-13 23:46:14,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:14,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:14,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:14,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:46:14,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 23:46:15,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:15,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:46:15,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 615 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-13 23:46:15,217 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:46:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618305365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:15,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:46:15,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:46:15,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663909820] [2024-10-13 23:46:15,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:15,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:15,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:15,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:15,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:46:15,219 INFO L87 Difference]: Start difference. First operand 14157 states and 16064 transitions. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:16,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:16,131 INFO L93 Difference]: Finished difference Result 27711 states and 31487 transitions. [2024-10-13 23:46:16,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:16,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 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 625 [2024-10-13 23:46:16,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:16,146 INFO L225 Difference]: With dead ends: 27711 [2024-10-13 23:46:16,146 INFO L226 Difference]: Without dead ends: 13854 [2024-10-13 23:46:16,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:46:16,157 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 252 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:16,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 601 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 879 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-13 23:46:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13854 states. [2024-10-13 23:46:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13854 to 13554. [2024-10-13 23:46:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 13553 states have (on average 1.0829336678226222) internal successors, (14677), 13553 states have internal predecessors, (14677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:16,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 14677 transitions. [2024-10-13 23:46:16,266 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 14677 transitions. Word has length 625 [2024-10-13 23:46:16,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:16,267 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 14677 transitions. [2024-10-13 23:46:16,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 14677 transitions. [2024-10-13 23:46:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2024-10-13 23:46:16,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:16,274 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:16,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 23:46:16,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:16,476 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:16,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:16,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1569391011, now seen corresponding path program 1 times [2024-10-13 23:46:16,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:16,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270923701] [2024-10-13 23:46:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:16,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:16,952 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 615 proven. 39 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-10-13 23:46:16,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:16,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270923701] [2024-10-13 23:46:16,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270923701] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:16,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930728290] [2024-10-13 23:46:16,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:16,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:16,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:16,955 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:46:16,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 23:46:17,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:17,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 23:46:17,134 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 654 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-10-13 23:46:17,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:46:17,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930728290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:17,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:46:17,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-13 23:46:17,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517744122] [2024-10-13 23:46:17,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:17,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:17,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:17,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:17,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:46:17,871 INFO L87 Difference]: Start difference. First operand 13554 states and 14677 transitions. Second operand has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:19,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:19,476 INFO L93 Difference]: Finished difference Result 28305 states and 30685 transitions. [2024-10-13 23:46:19,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:19,477 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 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 626 [2024-10-13 23:46:19,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:19,493 INFO L225 Difference]: With dead ends: 28305 [2024-10-13 23:46:19,493 INFO L226 Difference]: Without dead ends: 14752 [2024-10-13 23:46:19,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 629 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:46:19,504 INFO L432 NwaCegarLoop]: 316 mSDtfsCounter, 317 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:19,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 355 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 23:46:19,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14752 states. [2024-10-13 23:46:19,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14752 to 14452. [2024-10-13 23:46:19,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14452 states, 14451 states have (on average 1.080894055774687) internal successors, (15620), 14451 states have internal predecessors, (15620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:19,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14452 states to 14452 states and 15620 transitions. [2024-10-13 23:46:19,622 INFO L78 Accepts]: Start accepts. Automaton has 14452 states and 15620 transitions. Word has length 626 [2024-10-13 23:46:19,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:19,623 INFO L471 AbstractCegarLoop]: Abstraction has 14452 states and 15620 transitions. [2024-10-13 23:46:19,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.0) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 14452 states and 15620 transitions. [2024-10-13 23:46:19,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-10-13 23:46:19,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:19,630 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:19,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 23:46:19,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:19,831 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:19,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:19,831 INFO L85 PathProgramCache]: Analyzing trace with hash 928750202, now seen corresponding path program 1 times [2024-10-13 23:46:19,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:19,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443835663] [2024-10-13 23:46:19,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:19,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 266 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 23:46:20,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:20,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443835663] [2024-10-13 23:46:20,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443835663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:20,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997462013] [2024-10-13 23:46:20,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:20,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:20,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:20,794 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:46:20,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 23:46:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:20,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 23:46:20,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:24,330 INFO L134 CoverageAnalysis]: Checked inductivity of 618 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2024-10-13 23:46:24,330 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:46:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997462013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:24,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:46:24,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-13 23:46:24,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738515823] [2024-10-13 23:46:24,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:24,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:24,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:24,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:46:24,332 INFO L87 Difference]: Start difference. First operand 14452 states and 15620 transitions. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:25,436 INFO L93 Difference]: Finished difference Result 37280 states and 40277 transitions. [2024-10-13 23:46:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:25,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 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 663 [2024-10-13 23:46:25,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:25,458 INFO L225 Difference]: With dead ends: 37280 [2024-10-13 23:46:25,458 INFO L226 Difference]: Without dead ends: 22829 [2024-10-13 23:46:25,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 662 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:46:25,470 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 136 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:25,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 250 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:46:25,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22829 states. [2024-10-13 23:46:25,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22829 to 18939. [2024-10-13 23:46:25,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18939 states, 18938 states have (on average 1.0791002217763228) internal successors, (20436), 18938 states have internal predecessors, (20436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:25,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18939 states to 18939 states and 20436 transitions. [2024-10-13 23:46:25,623 INFO L78 Accepts]: Start accepts. Automaton has 18939 states and 20436 transitions. Word has length 663 [2024-10-13 23:46:25,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:25,623 INFO L471 AbstractCegarLoop]: Abstraction has 18939 states and 20436 transitions. [2024-10-13 23:46:25,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:25,624 INFO L276 IsEmpty]: Start isEmpty. Operand 18939 states and 20436 transitions. [2024-10-13 23:46:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 688 [2024-10-13 23:46:25,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:25,630 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:25,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 23:46:25,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-13 23:46:25,831 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:25,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1417746458, now seen corresponding path program 1 times [2024-10-13 23:46:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:25,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879199085] [2024-10-13 23:46:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:25,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 640 backedges. 182 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-10-13 23:46:26,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:26,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879199085] [2024-10-13 23:46:26,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879199085] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:26,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:26,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:46:26,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601070290] [2024-10-13 23:46:26,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:26,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:26,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:26,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:26,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:26,247 INFO L87 Difference]: Start difference. First operand 18939 states and 20436 transitions. Second operand has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:27,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:27,828 INFO L93 Difference]: Finished difference Result 48948 states and 52649 transitions. [2024-10-13 23:46:27,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:27,828 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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 687 [2024-10-13 23:46:27,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:27,853 INFO L225 Difference]: With dead ends: 48948 [2024-10-13 23:46:27,854 INFO L226 Difference]: Without dead ends: 30010 [2024-10-13 23:46:27,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:27,867 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 870 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 331 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:27,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 210 Invalid, 1719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [331 Valid, 1388 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 23:46:27,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30010 states. [2024-10-13 23:46:28,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30010 to 20132. [2024-10-13 23:46:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20132 states, 20131 states have (on average 1.0737171526501417) internal successors, (21615), 20131 states have internal predecessors, (21615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:28,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20132 states to 20132 states and 21615 transitions. [2024-10-13 23:46:28,045 INFO L78 Accepts]: Start accepts. Automaton has 20132 states and 21615 transitions. Word has length 687 [2024-10-13 23:46:28,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:28,045 INFO L471 AbstractCegarLoop]: Abstraction has 20132 states and 21615 transitions. [2024-10-13 23:46:28,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:28,045 INFO L276 IsEmpty]: Start isEmpty. Operand 20132 states and 21615 transitions. [2024-10-13 23:46:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2024-10-13 23:46:28,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:28,054 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:28,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 23:46:28,054 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:28,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:28,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1231133246, now seen corresponding path program 1 times [2024-10-13 23:46:28,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:28,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255606705] [2024-10-13 23:46:28,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:28,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2024-10-13 23:46:28,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:28,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255606705] [2024-10-13 23:46:28,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255606705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:28,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:28,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:28,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562344857] [2024-10-13 23:46:28,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:28,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:28,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:28,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:28,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:28,293 INFO L87 Difference]: Start difference. First operand 20132 states and 21615 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:29,246 INFO L93 Difference]: Finished difference Result 39961 states and 42915 transitions. [2024-10-13 23:46:29,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:29,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 718 [2024-10-13 23:46:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:29,262 INFO L225 Difference]: With dead ends: 39961 [2024-10-13 23:46:29,262 INFO L226 Difference]: Without dead ends: 19830 [2024-10-13 23:46:29,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:29,274 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 463 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:29,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 68 Invalid, 1024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 840 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:46:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19830 states. [2024-10-13 23:46:29,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19830 to 19829. [2024-10-13 23:46:29,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19829 states, 19828 states have (on average 1.074087149485576) internal successors, (21297), 19828 states have internal predecessors, (21297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:29,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19829 states to 19829 states and 21297 transitions. [2024-10-13 23:46:29,411 INFO L78 Accepts]: Start accepts. Automaton has 19829 states and 21297 transitions. Word has length 718 [2024-10-13 23:46:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:29,412 INFO L471 AbstractCegarLoop]: Abstraction has 19829 states and 21297 transitions. [2024-10-13 23:46:29,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:29,412 INFO L276 IsEmpty]: Start isEmpty. Operand 19829 states and 21297 transitions. [2024-10-13 23:46:29,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2024-10-13 23:46:29,422 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:29,422 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:29,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 23:46:29,422 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:29,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:29,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1099001505, now seen corresponding path program 1 times [2024-10-13 23:46:29,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:29,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744753929] [2024-10-13 23:46:29,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:29,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:29,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:29,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1279 backedges. 619 proven. 0 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2024-10-13 23:46:29,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:29,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744753929] [2024-10-13 23:46:29,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744753929] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:29,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:29,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:29,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450171987] [2024-10-13 23:46:29,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:29,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:29,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:29,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:29,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:29,647 INFO L87 Difference]: Start difference. First operand 19829 states and 21297 transitions. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:30,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:30,635 INFO L93 Difference]: Finished difference Result 45330 states and 48728 transitions. [2024-10-13 23:46:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:30,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 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 752 [2024-10-13 23:46:30,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:30,654 INFO L225 Difference]: With dead ends: 45330 [2024-10-13 23:46:30,654 INFO L226 Difference]: Without dead ends: 21914 [2024-10-13 23:46:30,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:30,668 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 281 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 314 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 314 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:30,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 507 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [314 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:46:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21914 states. [2024-10-13 23:46:30,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21914 to 19223. [2024-10-13 23:46:30,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19223 states, 19222 states have (on average 1.0456768286338571) internal successors, (20100), 19222 states have internal predecessors, (20100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:30,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19223 states to 19223 states and 20100 transitions. [2024-10-13 23:46:30,859 INFO L78 Accepts]: Start accepts. Automaton has 19223 states and 20100 transitions. Word has length 752 [2024-10-13 23:46:30,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:30,859 INFO L471 AbstractCegarLoop]: Abstraction has 19223 states and 20100 transitions. [2024-10-13 23:46:30,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:30,859 INFO L276 IsEmpty]: Start isEmpty. Operand 19223 states and 20100 transitions. [2024-10-13 23:46:30,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 828 [2024-10-13 23:46:30,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:30,868 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:30,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 23:46:30,869 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:30,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:30,869 INFO L85 PathProgramCache]: Analyzing trace with hash 25811987, now seen corresponding path program 1 times [2024-10-13 23:46:30,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:30,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553377502] [2024-10-13 23:46:30,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:30,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:30,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:31,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 692 proven. 188 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-13 23:46:31,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:31,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553377502] [2024-10-13 23:46:31,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553377502] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:31,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917626383] [2024-10-13 23:46:31,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:31,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:31,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:31,799 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:46:31,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 23:46:31,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:31,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 961 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:46:32,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1082 backedges. 735 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2024-10-13 23:46:32,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:46:32,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917626383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:32,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:46:32,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-13 23:46:32,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571003328] [2024-10-13 23:46:32,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:32,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:32,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:32,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:32,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:46:32,277 INFO L87 Difference]: Start difference. First operand 19223 states and 20100 transitions. Second operand has 4 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:33,695 INFO L93 Difference]: Finished difference Result 49248 states and 51406 transitions. [2024-10-13 23:46:33,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:33,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 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 827 [2024-10-13 23:46:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:33,721 INFO L225 Difference]: With dead ends: 49248 [2024-10-13 23:46:33,721 INFO L226 Difference]: Without dead ends: 29727 [2024-10-13 23:46:33,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 830 GetRequests, 825 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:46:33,733 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 370 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:33,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 567 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-13 23:46:33,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29727 states. [2024-10-13 23:46:33,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29727 to 24611. [2024-10-13 23:46:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24611 states, 24610 states have (on average 1.0429500203169444) internal successors, (25667), 24610 states have internal predecessors, (25667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24611 states to 24611 states and 25667 transitions. [2024-10-13 23:46:34,024 INFO L78 Accepts]: Start accepts. Automaton has 24611 states and 25667 transitions. Word has length 827 [2024-10-13 23:46:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:34,025 INFO L471 AbstractCegarLoop]: Abstraction has 24611 states and 25667 transitions. [2024-10-13 23:46:34,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:34,025 INFO L276 IsEmpty]: Start isEmpty. Operand 24611 states and 25667 transitions. [2024-10-13 23:46:34,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 836 [2024-10-13 23:46:34,041 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:34,041 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:34,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-13 23:46:34,241 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,SelfDestructingSolverStorable17 [2024-10-13 23:46:34,242 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:34,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:34,242 INFO L85 PathProgramCache]: Analyzing trace with hash 90506919, now seen corresponding path program 1 times [2024-10-13 23:46:34,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:34,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784844215] [2024-10-13 23:46:34,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:34,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:34,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:34,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1347 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-13 23:46:34,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:34,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784844215] [2024-10-13 23:46:34,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784844215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:34,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:34,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896423791] [2024-10-13 23:46:34,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:34,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:34,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:34,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:34,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:34,813 INFO L87 Difference]: Start difference. First operand 24611 states and 25667 transitions. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:35,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:35,534 INFO L93 Difference]: Finished difference Result 40211 states and 41759 transitions. [2024-10-13 23:46:35,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:35,535 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 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 835 [2024-10-13 23:46:35,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:35,545 INFO L225 Difference]: With dead ends: 40211 [2024-10-13 23:46:35,545 INFO L226 Difference]: Without dead ends: 15601 [2024-10-13 23:46:35,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:35,552 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 319 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:35,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 94 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:46:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15601 states. [2024-10-13 23:46:35,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15601 to 12899. [2024-10-13 23:46:35,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12899 states, 12898 states have (on average 1.0294619320824934) internal successors, (13278), 12898 states have internal predecessors, (13278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12899 states to 12899 states and 13278 transitions. [2024-10-13 23:46:35,638 INFO L78 Accepts]: Start accepts. Automaton has 12899 states and 13278 transitions. Word has length 835 [2024-10-13 23:46:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:35,639 INFO L471 AbstractCegarLoop]: Abstraction has 12899 states and 13278 transitions. [2024-10-13 23:46:35,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 12899 states and 13278 transitions. [2024-10-13 23:46:35,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 849 [2024-10-13 23:46:35,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:35,648 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:35,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 23:46:35,649 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:35,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:35,649 INFO L85 PathProgramCache]: Analyzing trace with hash -180597777, now seen corresponding path program 1 times [2024-10-13 23:46:35,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:35,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692823755] [2024-10-13 23:46:35,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:35,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 954 proven. 0 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2024-10-13 23:46:36,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:36,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692823755] [2024-10-13 23:46:36,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692823755] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:36,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:36,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210233339] [2024-10-13 23:46:36,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:36,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:36,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:36,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:36,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:36,063 INFO L87 Difference]: Start difference. First operand 12899 states and 13278 transitions. Second operand has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:36,681 INFO L93 Difference]: Finished difference Result 29699 states and 30620 transitions. [2024-10-13 23:46:36,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:36,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 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 848 [2024-10-13 23:46:36,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:36,693 INFO L225 Difference]: With dead ends: 29699 [2024-10-13 23:46:36,693 INFO L226 Difference]: Without dead ends: 16801 [2024-10-13 23:46:36,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:36,700 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 175 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:36,700 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 443 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:46:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16801 states. [2024-10-13 23:46:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16801 to 15303. [2024-10-13 23:46:36,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15303 states, 15302 states have (on average 1.0275780943667494) internal successors, (15724), 15302 states have internal predecessors, (15724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:36,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15303 states to 15303 states and 15724 transitions. [2024-10-13 23:46:36,800 INFO L78 Accepts]: Start accepts. Automaton has 15303 states and 15724 transitions. Word has length 848 [2024-10-13 23:46:36,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:36,800 INFO L471 AbstractCegarLoop]: Abstraction has 15303 states and 15724 transitions. [2024-10-13 23:46:36,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.0) internal successors, (507), 3 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:36,801 INFO L276 IsEmpty]: Start isEmpty. Operand 15303 states and 15724 transitions. [2024-10-13 23:46:36,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 869 [2024-10-13 23:46:36,809 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:36,809 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:46:36,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 23:46:36,809 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:36,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:36,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1729561592, now seen corresponding path program 1 times [2024-10-13 23:46:36,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:36,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367533638] [2024-10-13 23:46:36,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:36,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 641 proven. 269 refuted. 0 times theorem prover too weak. 228 trivial. 0 not checked. [2024-10-13 23:46:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367533638] [2024-10-13 23:46:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367533638] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1921030262] [2024-10-13 23:46:37,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:37,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:37,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:37,745 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:46:37,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 23:46:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:37,946 INFO L255 TraceCheckSpWp]: Trace formula consists of 1001 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:46:37,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1138 backedges. 658 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-10-13 23:46:38,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:46:38,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1921030262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:38,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:46:38,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-13 23:46:38,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685309628] [2024-10-13 23:46:38,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:38,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:38,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:38,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:46:38,178 INFO L87 Difference]: Start difference. First operand 15303 states and 15724 transitions. Second operand has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:39,198 INFO L93 Difference]: Finished difference Result 21599 states and 22159 transitions. [2024-10-13 23:46:39,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:39,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 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 868 [2024-10-13 23:46:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:39,217 INFO L225 Difference]: With dead ends: 21599 [2024-10-13 23:46:39,217 INFO L226 Difference]: Without dead ends: 21597 [2024-10-13 23:46:39,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 871 GetRequests, 866 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:46:39,224 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 450 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 1569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:39,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 76 Invalid, 1569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:46:39,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21597 states. [2024-10-13 23:46:39,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21597 to 15004. [2024-10-13 23:46:39,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15004 states, 15003 states have (on average 1.0275944811037792) internal successors, (15417), 15003 states have internal predecessors, (15417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:39,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15004 states to 15004 states and 15417 transitions. [2024-10-13 23:46:39,360 INFO L78 Accepts]: Start accepts. Automaton has 15004 states and 15417 transitions. Word has length 868 [2024-10-13 23:46:39,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:39,361 INFO L471 AbstractCegarLoop]: Abstraction has 15004 states and 15417 transitions. [2024-10-13 23:46:39,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:39,361 INFO L276 IsEmpty]: Start isEmpty. Operand 15004 states and 15417 transitions. [2024-10-13 23:46:39,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2024-10-13 23:46:39,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:39,370 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:39,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-13 23:46:39,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:39,571 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:39,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1130952965, now seen corresponding path program 1 times [2024-10-13 23:46:39,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:39,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766898181] [2024-10-13 23:46:39,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:39,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:39,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1188 backedges. 664 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2024-10-13 23:46:39,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:39,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766898181] [2024-10-13 23:46:39,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766898181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:39,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:39,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:46:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430797344] [2024-10-13 23:46:39,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:39,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:39,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:39,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:39,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:39,879 INFO L87 Difference]: Start difference. First operand 15004 states and 15417 transitions. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:40,471 INFO L93 Difference]: Finished difference Result 31800 states and 32671 transitions. [2024-10-13 23:46:40,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:40,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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 880 [2024-10-13 23:46:40,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:40,484 INFO L225 Difference]: With dead ends: 31800 [2024-10-13 23:46:40,485 INFO L226 Difference]: Without dead ends: 16498 [2024-10-13 23:46:40,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:46:40,494 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 308 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 711 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 711 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:40,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 430 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 711 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:46:40,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16498 states. [2024-10-13 23:46:40,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16498 to 14702. [2024-10-13 23:46:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14702 states, 14701 states have (on average 1.026596830147609) internal successors, (15092), 14701 states have internal predecessors, (15092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:40,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14702 states to 14702 states and 15092 transitions. [2024-10-13 23:46:40,595 INFO L78 Accepts]: Start accepts. Automaton has 14702 states and 15092 transitions. Word has length 880 [2024-10-13 23:46:40,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:40,596 INFO L471 AbstractCegarLoop]: Abstraction has 14702 states and 15092 transitions. [2024-10-13 23:46:40,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:40,596 INFO L276 IsEmpty]: Start isEmpty. Operand 14702 states and 15092 transitions. [2024-10-13 23:46:40,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 902 [2024-10-13 23:46:40,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:40,605 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:40,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 23:46:40,605 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:40,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:40,605 INFO L85 PathProgramCache]: Analyzing trace with hash 42576084, now seen corresponding path program 1 times [2024-10-13 23:46:40,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:40,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229489192] [2024-10-13 23:46:40,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:40,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:40,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 731 trivial. 0 not checked. [2024-10-13 23:46:41,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:41,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229489192] [2024-10-13 23:46:41,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229489192] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:41,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:41,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:46:41,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504012021] [2024-10-13 23:46:41,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:41,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:41,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:41,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:41,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:41,216 INFO L87 Difference]: Start difference. First operand 14702 states and 15092 transitions. Second operand has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:42,212 INFO L93 Difference]: Finished difference Result 34199 states and 35082 transitions. [2024-10-13 23:46:42,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:42,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 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 901 [2024-10-13 23:46:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:42,227 INFO L225 Difference]: With dead ends: 34199 [2024-10-13 23:46:42,227 INFO L226 Difference]: Without dead ends: 19199 [2024-10-13 23:46:42,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:42,236 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 490 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:42,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 391 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 23:46:42,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19199 states. [2024-10-13 23:46:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19199 to 13804. [2024-10-13 23:46:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13804 states, 13803 states have (on average 1.0267333188437295) internal successors, (14172), 13803 states have internal predecessors, (14172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13804 states to 13804 states and 14172 transitions. [2024-10-13 23:46:42,346 INFO L78 Accepts]: Start accepts. Automaton has 13804 states and 14172 transitions. Word has length 901 [2024-10-13 23:46:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:42,346 INFO L471 AbstractCegarLoop]: Abstraction has 13804 states and 14172 transitions. [2024-10-13 23:46:42,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 13804 states and 14172 transitions. [2024-10-13 23:46:42,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 906 [2024-10-13 23:46:42,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:42,355 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:42,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 23:46:42,356 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:42,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:42,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1619083546, now seen corresponding path program 1 times [2024-10-13 23:46:42,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:42,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597162465] [2024-10-13 23:46:42,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:42,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 1003 proven. 183 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-13 23:46:43,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597162465] [2024-10-13 23:46:43,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597162465] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:43,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315089533] [2024-10-13 23:46:43,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:43,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:43,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:43,331 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:46:43,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 23:46:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:43,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 23:46:43,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:43,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 1133 proven. 76 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2024-10-13 23:46:43,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 23:46:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 1058 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-10-13 23:46:44,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315089533] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:44,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-10-13 23:46:44,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 4] total 8 [2024-10-13 23:46:44,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068600029] [2024-10-13 23:46:44,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:44,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:46:44,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:44,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:46:44,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:46:44,315 INFO L87 Difference]: Start difference. First operand 13804 states and 14172 transitions. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:45,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:45,029 INFO L93 Difference]: Finished difference Result 28506 states and 29262 transitions. [2024-10-13 23:46:45,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:46:45,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 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 905 [2024-10-13 23:46:45,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:45,043 INFO L225 Difference]: With dead ends: 28506 [2024-10-13 23:46:45,043 INFO L226 Difference]: Without dead ends: 14703 [2024-10-13 23:46:45,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1815 GetRequests, 1809 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 23:46:45,052 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 242 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:45,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 43 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 716 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 23:46:45,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14703 states. [2024-10-13 23:46:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14703 to 14101. [2024-10-13 23:46:45,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14101 states, 14100 states have (on average 1.0243971631205673) internal successors, (14444), 14100 states have internal predecessors, (14444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:45,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14101 states to 14101 states and 14444 transitions. [2024-10-13 23:46:45,167 INFO L78 Accepts]: Start accepts. Automaton has 14101 states and 14444 transitions. Word has length 905 [2024-10-13 23:46:45,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:45,167 INFO L471 AbstractCegarLoop]: Abstraction has 14101 states and 14444 transitions. [2024-10-13 23:46:45,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:45,167 INFO L276 IsEmpty]: Start isEmpty. Operand 14101 states and 14444 transitions. [2024-10-13 23:46:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2024-10-13 23:46:45,176 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:45,176 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:45,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-13 23:46:45,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-13 23:46:45,381 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:45,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:45,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1868970456, now seen corresponding path program 1 times [2024-10-13 23:46:45,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:45,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120317135] [2024-10-13 23:46:45,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:45,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:45,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1477 backedges. 861 proven. 188 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2024-10-13 23:46:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:46,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120317135] [2024-10-13 23:46:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120317135] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:46:46,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307556901] [2024-10-13 23:46:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:46,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:46:46,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:46:46,322 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:46:46,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 23:46:46,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:46,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 1066 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:46:46,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:46:52,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1477 backedges. 881 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-10-13 23:46:52,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:46:52,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307556901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:52,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:46:52,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2024-10-13 23:46:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106049248] [2024-10-13 23:46:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:52,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:52,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:52,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:52,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:46:52,397 INFO L87 Difference]: Start difference. First operand 14101 states and 14444 transitions. Second operand has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:58,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:46:58,022 INFO L93 Difference]: Finished difference Result 35099 states and 35915 transitions. [2024-10-13 23:46:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:46:58,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 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 914 [2024-10-13 23:46:58,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:46:58,038 INFO L225 Difference]: With dead ends: 35099 [2024-10-13 23:46:58,038 INFO L226 Difference]: Without dead ends: 20700 [2024-10-13 23:46:58,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 917 GetRequests, 912 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 23:46:58,047 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 358 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1461 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:46:58,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 83 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1461 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-13 23:46:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20700 states. [2024-10-13 23:46:58,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20700 to 17697. [2024-10-13 23:46:58,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17697 states, 17696 states have (on average 1.0231690777576854) internal successors, (18106), 17696 states have internal predecessors, (18106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:58,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17697 states to 17697 states and 18106 transitions. [2024-10-13 23:46:58,181 INFO L78 Accepts]: Start accepts. Automaton has 17697 states and 18106 transitions. Word has length 914 [2024-10-13 23:46:58,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:46:58,182 INFO L471 AbstractCegarLoop]: Abstraction has 17697 states and 18106 transitions. [2024-10-13 23:46:58,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:46:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 17697 states and 18106 transitions. [2024-10-13 23:46:58,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2024-10-13 23:46:58,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:46:58,192 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:46:58,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-13 23:46:58,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-13 23:46:58,393 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:46:58,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:46:58,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1621128064, now seen corresponding path program 1 times [2024-10-13 23:46:58,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:46:58,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018495124] [2024-10-13 23:46:58,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:46:58,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:46:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:46:59,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 888 proven. 0 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-10-13 23:46:59,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:46:59,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018495124] [2024-10-13 23:46:59,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018495124] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:46:59,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:46:59,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 23:46:59,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456422900] [2024-10-13 23:46:59,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:46:59,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:46:59,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:46:59,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:46:59,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:46:59,034 INFO L87 Difference]: Start difference. First operand 17697 states and 18106 transitions. Second operand has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:47:00,084 INFO L93 Difference]: Finished difference Result 39894 states and 40796 transitions. [2024-10-13 23:47:00,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:47:00,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 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 917 [2024-10-13 23:47:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:47:00,101 INFO L225 Difference]: With dead ends: 39894 [2024-10-13 23:47:00,101 INFO L226 Difference]: Without dead ends: 21899 [2024-10-13 23:47:00,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 23:47:00,112 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 359 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 23:47:00,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 55 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 23:47:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21899 states. [2024-10-13 23:47:00,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21899 to 15602. [2024-10-13 23:47:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15602 states, 15601 states have (on average 1.024036920710211) internal successors, (15976), 15601 states have internal predecessors, (15976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15602 states to 15602 states and 15976 transitions. [2024-10-13 23:47:00,247 INFO L78 Accepts]: Start accepts. Automaton has 15602 states and 15976 transitions. Word has length 917 [2024-10-13 23:47:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:47:00,247 INFO L471 AbstractCegarLoop]: Abstraction has 15602 states and 15976 transitions. [2024-10-13 23:47:00,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 140.0) internal successors, (560), 4 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 15602 states and 15976 transitions. [2024-10-13 23:47:00,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 923 [2024-10-13 23:47:00,256 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:47:00,257 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-13 23:47:00,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 23:47:00,257 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:47:00,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:47:00,257 INFO L85 PathProgramCache]: Analyzing trace with hash -863499332, now seen corresponding path program 1 times [2024-10-13 23:47:00,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:47:00,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038030864] [2024-10-13 23:47:00,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:00,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:47:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:01,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 1014 proven. 501 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2024-10-13 23:47:01,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:47:01,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038030864] [2024-10-13 23:47:01,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038030864] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 23:47:01,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689869747] [2024-10-13 23:47:01,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:01,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 23:47:01,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 23:47:01,522 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 23:47:01,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 23:47:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:01,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 23:47:01,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 23:47:02,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 759 proven. 0 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2024-10-13 23:47:02,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 23:47:02,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689869747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:47:02,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 23:47:02,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-10-13 23:47:02,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522062167] [2024-10-13 23:47:02,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:47:02,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 23:47:02,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:47:02,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 23:47:02,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:47:02,277 INFO L87 Difference]: Start difference. First operand 15602 states and 15976 transitions. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:06,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 23:47:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:47:07,537 INFO L93 Difference]: Finished difference Result 34504 states and 35302 transitions. [2024-10-13 23:47:07,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 23:47:07,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 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 922 [2024-10-13 23:47:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:47:07,550 INFO L225 Difference]: With dead ends: 34504 [2024-10-13 23:47:07,550 INFO L226 Difference]: Without dead ends: 18604 [2024-10-13 23:47:07,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 926 GetRequests, 922 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-13 23:47:07,559 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 490 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 102 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-10-13 23:47:07,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 79 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1436 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2024-10-13 23:47:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18604 states. [2024-10-13 23:47:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18604 to 14103. [2024-10-13 23:47:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14103 states, 14102 states have (on average 1.023968231456531) internal successors, (14440), 14102 states have internal predecessors, (14440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14103 states to 14103 states and 14440 transitions. [2024-10-13 23:47:07,695 INFO L78 Accepts]: Start accepts. Automaton has 14103 states and 14440 transitions. Word has length 922 [2024-10-13 23:47:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:47:07,695 INFO L471 AbstractCegarLoop]: Abstraction has 14103 states and 14440 transitions. [2024-10-13 23:47:07,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 14103 states and 14440 transitions. [2024-10-13 23:47:07,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1544 [2024-10-13 23:47:07,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 23:47:07,712 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 23:47:07,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 23:47:07,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-13 23:47:07,913 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 23:47:07,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 23:47:07,914 INFO L85 PathProgramCache]: Analyzing trace with hash 92138732, now seen corresponding path program 1 times [2024-10-13 23:47:07,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 23:47:07,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249316154] [2024-10-13 23:47:07,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 23:47:07,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 23:47:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 23:47:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3774 backedges. 2368 proven. 0 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2024-10-13 23:47:08,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 23:47:08,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249316154] [2024-10-13 23:47:08,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249316154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 23:47:08,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 23:47:08,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 23:47:08,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265327291] [2024-10-13 23:47:08,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 23:47:08,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 23:47:08,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 23:47:08,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 23:47:08,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:08,444 INFO L87 Difference]: Start difference. First operand 14103 states and 14440 transitions. Second operand has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 23:47:09,036 INFO L93 Difference]: Finished difference Result 26704 states and 27342 transitions. [2024-10-13 23:47:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 23:47:09,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 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 1543 [2024-10-13 23:47:09,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 23:47:09,038 INFO L225 Difference]: With dead ends: 26704 [2024-10-13 23:47:09,038 INFO L226 Difference]: Without dead ends: 0 [2024-10-13 23:47:09,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 23:47:09,046 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 34 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 23:47:09,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 399 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 23:47:09,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-13 23:47:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-13 23:47:09,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:09,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-13 23:47:09,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1543 [2024-10-13 23:47:09,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 23:47:09,047 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 23:47:09,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 23:47:09,048 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-13 23:47:09,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-13 23:47:09,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 23:47:09,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 23:47:09,052 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-13 23:47:09,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-13 23:47:18,403 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 23:47:18,426 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-13 23:47:18,427 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-13 23:47:18,429 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-13 23:47:18,431 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-13 23:47:18,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 11:47:18 BoogieIcfgContainer [2024-10-13 23:47:18,439 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 23:47:18,440 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 23:47:18,440 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 23:47:18,440 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 23:47:18,441 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:45:57" (3/4) ... [2024-10-13 23:47:18,442 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 23:47:18,464 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-13 23:47:18,466 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 23:47:18,467 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-13 23:47:18,469 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 23:47:18,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 23:47:18,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 23:47:18,633 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 23:47:18,634 INFO L158 Benchmark]: Toolchain (without parser) took 84436.27ms. Allocated memory was 176.2MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 141.8MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 119.1MB. Max. memory is 16.1GB. [2024-10-13 23:47:18,634 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory was 91.8MB in the beginning and 91.6MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 23:47:18,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 760.33ms. Allocated memory is still 176.2MB. Free memory was 141.0MB in the beginning and 111.8MB in the end (delta: 29.2MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. [2024-10-13 23:47:18,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.57ms. Allocated memory is still 176.2MB. Free memory was 111.8MB in the beginning and 73.1MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-10-13 23:47:18,634 INFO L158 Benchmark]: Boogie Preprocessor took 277.04ms. Allocated memory was 176.2MB in the beginning and 283.1MB in the end (delta: 107.0MB). Free memory was 73.1MB in the beginning and 172.5MB in the end (delta: -99.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2024-10-13 23:47:18,634 INFO L158 Benchmark]: RCFGBuilder took 1789.64ms. Allocated memory is still 283.1MB. Free memory was 172.5MB in the beginning and 197.6MB in the end (delta: -25.1MB). Peak memory consumption was 123.3MB. Max. memory is 16.1GB. [2024-10-13 23:47:18,635 INFO L158 Benchmark]: TraceAbstraction took 81285.16ms. Allocated memory was 283.1MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 197.6MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-10-13 23:47:18,635 INFO L158 Benchmark]: Witness Printer took 193.50ms. Allocated memory is still 2.1GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-13 23:47:18,636 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory was 91.8MB in the beginning and 91.6MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 760.33ms. Allocated memory is still 176.2MB. Free memory was 141.0MB in the beginning and 111.8MB in the end (delta: 29.2MB). Peak memory consumption was 61.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.57ms. Allocated memory is still 176.2MB. Free memory was 111.8MB in the beginning and 73.1MB in the end (delta: 38.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 277.04ms. Allocated memory was 176.2MB in the beginning and 283.1MB in the end (delta: 107.0MB). Free memory was 73.1MB in the beginning and 172.5MB in the end (delta: -99.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1789.64ms. Allocated memory is still 283.1MB. Free memory was 172.5MB in the beginning and 197.6MB in the end (delta: -25.1MB). Peak memory consumption was 123.3MB. Max. memory is 16.1GB. * TraceAbstraction took 81285.16ms. Allocated memory was 283.1MB in the beginning and 2.1GB in the end (delta: 1.8GB). Free memory was 197.6MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 193.50ms. Allocated memory is still 2.1GB. Free memory was 2.0GB in the beginning and 2.0GB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 206]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 362 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.8s, OverallIterations: 28, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 38.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 8459 SdHoareTripleChecker+Valid, 35.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8459 mSDsluCounter, 9769 SdHoareTripleChecker+Invalid, 31.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 830 mSDsCounter, 4401 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28248 IncrementalHoareTripleChecker+Invalid, 32650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4401 mSolverCounterUnsat, 8939 mSDtfsCounter, 28248 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8400 GetRequests, 8333 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24611occurred in iteration=18, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 56988 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 24.2s InterpolantComputationTime, 24998 NumberOfCodeBlocks, 24998 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 25864 ConstructedInterpolants, 347 QuantifiedInterpolants, 108599 SizeOfPredicates, 3 NumberOfNonLiveVariables, 8810 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 39 InterpolantComputations, 28 PerfectInterpolantSequences, 36184/38097 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((48790 <= a29) && (((long long) 89 + a4) <= 0)) && (5 <= a2)) || (((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (a2 == 1)) && (0 <= ((long long) 600001 + a29)))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) 600001 + a29))) && (3 == a2)) && (((long long) a29 + 127) <= 0))) || ((((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) a29 + 13))) && (0 <= ((long long) a0 + 145)))) || ((((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (((long long) a29 + 127) <= 0))) || (((((((long long) 42 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2)) && (168789 <= a29))) || (((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (a2 == 1)) && (0 <= ((long long) 142 + a29))) && (a29 <= 43))) || ((((((long long) 42 + a4) <= 0) && (((long long) a0 + 147) <= 0)) && (3 == a2)) && (a29 <= 43))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (((long long) 98 + a0) <= 0))) || (((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (3 == a2))) || ((((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 146 + a0))) && (5 <= a2))) || ((((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (a2 == 4)) && (0 <= ((long long) 600001 + a29))) && (((long long) a29 + 127) <= 0))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 1))) || ((((44 <= a29) && (((long long) 89 + a4) <= 0)) && (((long long) 98 + a0) <= 0)) && (5 <= a2))) || (((((0 <= ((long long) 97 + a0)) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) a29 + 16))) && (5 <= a2)) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (a2 == 4))) || ((((((long long) 89 + a4) <= 0) && (a2 == 4)) && (0 <= ((long long) 600001 + a29))) && (a29 <= 43))) || (((((long long) 89 + a4) <= 0) && (0 <= ((long long) 600001 + a29))) && (3 == a2))) || (((((long long) 89 + a4) <= 0) && (a2 == 1)) && (a29 <= 43))) || (((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) 600001 + a29))) && (3 == a2)) && (a29 <= 43))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) 98 + a0) <= 0)) && (5 <= a2)) && (0 <= ((long long) 600001 + a29))) && (0 <= ((long long) a0 + 145)))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (((long long) 98 + a0) <= 0))) || (((((long long) 89 + a4) <= 0) && (((long long) 98 + a0) <= 0)) && (3 == a2))) || ((((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (a2 == 4)) && (0 <= ((long long) a29 + 13)))) || ((((long long) a0 + 147) <= 0) && (((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (5 <= a2)) && (168789 <= a29)) || ((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (5 <= a2))))) || (((((((long long) 42 + a4) <= 0) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) a29 + 13)))) || (((((((long long) 148 + a0) <= 0) && (0 <= ((long long) 599999 + a0))) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (5 <= a2))) || ((((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) a29 + 16))) && (a2 == 1)) && (a29 <= 43))) || ((((((((long long) 148 + a0) <= 0) && (0 <= ((long long) 599999 + a0))) && (((long long) 42 + a4) <= 0)) && (0 <= ((long long) a4 + 85))) && (a2 == 4)) && (0 <= ((long long) 142 + a29)))) || ((((((long long) 148 + a0) <= 0) && (((long long) 42 + a4) <= 0)) && (44 <= a29)) && (a2 == 1))) || ((((((0 <= ((long long) 599999 + a0)) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (0 <= ((long long) a29 + 16)))) || ((((((((long long) 148 + a0) <= 0) && (0 <= ((long long) 599999 + a0))) && (((long long) 42 + a4) <= 0)) && (2 == a2)) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) 600001 + a29)))) || (((2 == a2) && (((long long) 89 + a4) <= 0)) && (0 <= ((long long) 600001 + a29)))) || ((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (((long long) a0 + 147) <= 0)) && (5 <= a2)) && (0 <= ((long long) 142 + a29))) && (a29 <= 43))) || ((((((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (44 <= a29)) && (3 == a2)) && (0 <= ((long long) a0 + 145))) || ((((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (0 <= ((long long) 141 + a0))) && (3 == a2))) && (((long long) 98 + a0) <= 0)) && (0 <= ((long long) 600001 + a29)))) || ((((((long long) 148 + a0) <= 0) && (0 <= ((long long) 599999 + a0))) && (((long long) 42 + a4) <= 0)) && (a2 == 1))) RESULT: Ultimate proved your program to be correct! [2024-10-13 23:47:18,677 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0