./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label19.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8aa577dc4c04bf53d7d29751ed362e9afcf94d1db611db106e7ed08797634e47 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:49:03,139 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:49:03,202 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:49:03,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:49:03,207 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:49:03,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:49:03,237 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:49:03,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:49:03,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:49:03,239 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:49:03,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:49:03,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:49:03,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:49:03,241 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:49:03,241 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:49:03,241 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:49:03,242 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:49:03,242 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:49:03,242 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:49:03,242 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:49:03,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:49:03,247 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:49:03,247 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:49:03,247 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:49:03,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:49:03,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:49:03,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:49:03,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:49:03,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:49:03,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:49:03,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:49:03,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:49:03,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:49:03,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:49:03,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:49:03,253 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:49:03,253 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:49:03,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:49:03,253 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:49:03,253 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:49:03,253 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:49:03,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:49:03,254 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 -> 8aa577dc4c04bf53d7d29751ed362e9afcf94d1db611db106e7ed08797634e47 [2024-11-11 16:49:03,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:49:03,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:49:03,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:49:03,549 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:49:03,550 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:49:03,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2024-11-11 16:49:04,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:49:05,163 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:49:05,164 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c [2024-11-11 16:49:05,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d48414e60/b2659b5425ba4dcabfd8c98ffe07b481/FLAG144f62237 [2024-11-11 16:49:05,476 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d48414e60/b2659b5425ba4dcabfd8c98ffe07b481 [2024-11-11 16:49:05,478 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:49:05,479 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:49:05,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:49:05,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:49:05,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:49:05,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:49:05" (1/1) ... [2024-11-11 16:49:05,491 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69b8d1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:05, skipping insertion in model container [2024-11-11 16:49:05,491 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:49:05" (1/1) ... [2024-11-11 16:49:05,542 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:49:05,805 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c[8142,8155] [2024-11-11 16:49:06,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:49:06,139 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:49:06,175 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label19.c[8142,8155] [2024-11-11 16:49:06,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:49:06,302 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:49:06,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06 WrapperNode [2024-11-11 16:49:06,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:49:06,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:49:06,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:49:06,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:49:06,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,343 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,433 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-11 16:49:06,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:49:06,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:49:06,435 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:49:06,435 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:49:06,445 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,446 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,518 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:49:06,518 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,518 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,584 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,598 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,611 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:49:06,612 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:49:06,612 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:49:06,612 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:49:06,613 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (1/1) ... [2024-11-11 16:49:06,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:49:06,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:49:06,648 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:49:06,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:49:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:49:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:49:06,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:49:06,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:49:06,756 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:49:06,758 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:49:08,272 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-11 16:49:08,273 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:49:08,290 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:49:08,290 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:49:08,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:49:08 BoogieIcfgContainer [2024-11-11 16:49:08,291 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:49:08,292 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:49:08,292 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:49:08,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:49:08,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:49:05" (1/3) ... [2024-11-11 16:49:08,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8042bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:49:08, skipping insertion in model container [2024-11-11 16:49:08,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:49:06" (2/3) ... [2024-11-11 16:49:08,297 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d8042bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:49:08, skipping insertion in model container [2024-11-11 16:49:08,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:49:08" (3/3) ... [2024-11-11 16:49:08,298 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label19.c [2024-11-11 16:49:08,315 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:49:08,316 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:49:08,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:49:08,394 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;@10d86dc4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:49:08,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:49:08,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-11 16:49:08,410 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:08,411 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:08,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:08,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:08,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2158734, now seen corresponding path program 1 times [2024-11-11 16:49:08,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:08,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705692945] [2024-11-11 16:49:08,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:08,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:08,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:08,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:08,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705692945] [2024-11-11 16:49:08,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705692945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:08,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:08,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:08,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013459296] [2024-11-11 16:49:08,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:08,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:08,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:08,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:08,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:08,848 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:09,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:09,940 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-11 16:49:09,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:09,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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 56 [2024-11-11 16:49:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:09,955 INFO L225 Difference]: With dead ends: 761 [2024-11-11 16:49:09,955 INFO L226 Difference]: Without dead ends: 413 [2024-11-11 16:49:09,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:09,963 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 172 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:09,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:49:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-11 16:49:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-11 16:49:10,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:10,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-11 16:49:10,021 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 56 [2024-11-11 16:49:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:10,022 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-11 16:49:10,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-11 16:49:10,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 16:49:10,027 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:10,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:10,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:49:10,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:10,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:10,029 INFO L85 PathProgramCache]: Analyzing trace with hash 145975082, now seen corresponding path program 1 times [2024-11-11 16:49:10,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:10,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712969339] [2024-11-11 16:49:10,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:10,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:10,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:10,246 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:10,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:10,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712969339] [2024-11-11 16:49:10,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712969339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:10,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:10,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:10,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136020924] [2024-11-11 16:49:10,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:10,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:10,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:10,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:10,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:10,251 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:10,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:10,991 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-11 16:49:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:10,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2024-11-11 16:49:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:10,997 INFO L225 Difference]: With dead ends: 1211 [2024-11-11 16:49:10,997 INFO L226 Difference]: Without dead ends: 800 [2024-11-11 16:49:10,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:11,000 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 144 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:11,001 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 118 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-11 16:49:11,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-11 16:49:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3756345177664975) internal successors, (1084), 788 states have internal predecessors, (1084), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:11,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1084 transitions. [2024-11-11 16:49:11,038 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1084 transitions. Word has length 124 [2024-11-11 16:49:11,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:11,038 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1084 transitions. [2024-11-11 16:49:11,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1084 transitions. [2024-11-11 16:49:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 16:49:11,041 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:11,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:11,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:49:11,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:11,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash -87355732, now seen corresponding path program 1 times [2024-11-11 16:49:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:11,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653175581] [2024-11-11 16:49:11,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:11,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:11,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653175581] [2024-11-11 16:49:11,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653175581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:11,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:11,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636849008] [2024-11-11 16:49:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:11,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:11,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:11,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:11,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:11,445 INFO L87 Difference]: Start difference. First operand 789 states and 1084 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:12,128 INFO L93 Difference]: Finished difference Result 1945 states and 2614 transitions. [2024-11-11 16:49:12,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:12,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2024-11-11 16:49:12,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:12,135 INFO L225 Difference]: With dead ends: 1945 [2024-11-11 16:49:12,136 INFO L226 Difference]: Without dead ends: 1158 [2024-11-11 16:49:12,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:12,140 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:12,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:12,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-11 16:49:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-11 16:49:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2716262975778547) internal successors, (1470), 1156 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:12,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1470 transitions. [2024-11-11 16:49:12,169 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1470 transitions. Word has length 125 [2024-11-11 16:49:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:12,170 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1470 transitions. [2024-11-11 16:49:12,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1470 transitions. [2024-11-11 16:49:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-11 16:49:12,173 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:12,174 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:12,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:49:12,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:12,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:12,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1822006727, now seen corresponding path program 1 times [2024-11-11 16:49:12,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:12,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564324951] [2024-11-11 16:49:12,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:12,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:12,414 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:12,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:12,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564324951] [2024-11-11 16:49:12,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564324951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:12,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:12,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:12,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279239680] [2024-11-11 16:49:12,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:12,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:12,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:12,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:12,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:12,418 INFO L87 Difference]: Start difference. First operand 1157 states and 1470 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:13,113 INFO L93 Difference]: Finished difference Result 2519 states and 3352 transitions. [2024-11-11 16:49:13,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:13,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 183 [2024-11-11 16:49:13,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:13,120 INFO L225 Difference]: With dead ends: 2519 [2024-11-11 16:49:13,121 INFO L226 Difference]: Without dead ends: 1548 [2024-11-11 16:49:13,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:13,127 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 179 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:13,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:13,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-11 16:49:13,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2024-11-11 16:49:13,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.294041450777202) internal successors, (1998), 1544 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1998 transitions. [2024-11-11 16:49:13,187 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1998 transitions. Word has length 183 [2024-11-11 16:49:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:13,189 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1998 transitions. [2024-11-11 16:49:13,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1998 transitions. [2024-11-11 16:49:13,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2024-11-11 16:49:13,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:13,195 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:49:13,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:49:13,196 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:13,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:13,197 INFO L85 PathProgramCache]: Analyzing trace with hash -293129306, now seen corresponding path program 1 times [2024-11-11 16:49:13,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:13,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718786447] [2024-11-11 16:49:13,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:13,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:13,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:13,468 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:13,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:13,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718786447] [2024-11-11 16:49:13,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718786447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:13,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:13,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:13,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661370224] [2024-11-11 16:49:13,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:13,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:13,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:13,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:13,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:13,475 INFO L87 Difference]: Start difference. First operand 1545 states and 1998 transitions. Second operand has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:14,193 INFO L93 Difference]: Finished difference Result 3656 states and 4826 transitions. [2024-11-11 16:49:14,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:14,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 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 236 [2024-11-11 16:49:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:14,201 INFO L225 Difference]: With dead ends: 3656 [2024-11-11 16:49:14,202 INFO L226 Difference]: Without dead ends: 2297 [2024-11-11 16:49:14,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:14,204 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 136 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:14,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 340 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:14,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2297 states. [2024-11-11 16:49:14,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2297 to 2100. [2024-11-11 16:49:14,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.2706050500238208) internal successors, (2667), 2099 states have internal predecessors, (2667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:14,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2667 transitions. [2024-11-11 16:49:14,238 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2667 transitions. Word has length 236 [2024-11-11 16:49:14,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:14,239 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2667 transitions. [2024-11-11 16:49:14,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.66666666666667) internal successors, (236), 3 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2667 transitions. [2024-11-11 16:49:14,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-11-11 16:49:14,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:14,242 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:49:14,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:49:14,243 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:14,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash -814689872, now seen corresponding path program 1 times [2024-11-11 16:49:14,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:14,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764210158] [2024-11-11 16:49:14,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:14,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:14,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:14,821 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:14,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:14,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764210158] [2024-11-11 16:49:14,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764210158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:14,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:14,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:49:14,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967556919] [2024-11-11 16:49:14,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:14,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:49:14,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:14,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:49:14,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:14,824 INFO L87 Difference]: Start difference. First operand 2100 states and 2667 transitions. Second operand has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:16,231 INFO L93 Difference]: Finished difference Result 6988 states and 9014 transitions. [2024-11-11 16:49:16,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:49:16,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 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 237 [2024-11-11 16:49:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:16,253 INFO L225 Difference]: With dead ends: 6988 [2024-11-11 16:49:16,253 INFO L226 Difference]: Without dead ends: 4890 [2024-11-11 16:49:16,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:16,259 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 322 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1125 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 1125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:16,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 72 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 1125 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 16:49:16,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4890 states. [2024-11-11 16:49:16,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4890 to 4690. [2024-11-11 16:49:16,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4690 states, 4689 states have (on average 1.2518660695244188) internal successors, (5870), 4689 states have internal predecessors, (5870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4690 states to 4690 states and 5870 transitions. [2024-11-11 16:49:16,341 INFO L78 Accepts]: Start accepts. Automaton has 4690 states and 5870 transitions. Word has length 237 [2024-11-11 16:49:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:16,342 INFO L471 AbstractCegarLoop]: Abstraction has 4690 states and 5870 transitions. [2024-11-11 16:49:16,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 59.25) internal successors, (237), 4 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 4690 states and 5870 transitions. [2024-11-11 16:49:16,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-11 16:49:16,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:16,347 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:16,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:49:16,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:16,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash 298488641, now seen corresponding path program 1 times [2024-11-11 16:49:16,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:16,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712094940] [2024-11-11 16:49:16,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:16,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:16,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:49:16,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:16,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712094940] [2024-11-11 16:49:16,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712094940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:16,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:16,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:16,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151339675] [2024-11-11 16:49:16,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:16,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:16,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:16,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:16,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:16,587 INFO L87 Difference]: Start difference. First operand 4690 states and 5870 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:17,340 INFO L93 Difference]: Finished difference Result 10496 states and 13349 transitions. [2024-11-11 16:49:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:17,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 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 238 [2024-11-11 16:49:17,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:17,363 INFO L225 Difference]: With dead ends: 10496 [2024-11-11 16:49:17,363 INFO L226 Difference]: Without dead ends: 6176 [2024-11-11 16:49:17,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:17,372 INFO L435 NwaCegarLoop]: 350 mSDtfsCounter, 141 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:17,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 371 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:17,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6176 states. [2024-11-11 16:49:17,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6176 to 5978. [2024-11-11 16:49:17,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5978 states, 5977 states have (on average 1.2297139032959679) internal successors, (7350), 5977 states have internal predecessors, (7350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:17,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5978 states to 5978 states and 7350 transitions. [2024-11-11 16:49:17,470 INFO L78 Accepts]: Start accepts. Automaton has 5978 states and 7350 transitions. Word has length 238 [2024-11-11 16:49:17,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:17,471 INFO L471 AbstractCegarLoop]: Abstraction has 5978 states and 7350 transitions. [2024-11-11 16:49:17,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:17,471 INFO L276 IsEmpty]: Start isEmpty. Operand 5978 states and 7350 transitions. [2024-11-11 16:49:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2024-11-11 16:49:17,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:17,475 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:49:17,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:49:17,476 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:17,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash -70460415, now seen corresponding path program 1 times [2024-11-11 16:49:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:17,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861711101] [2024-11-11 16:49:17,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:17,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-11 16:49:17,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:17,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861711101] [2024-11-11 16:49:17,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861711101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:17,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:17,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:17,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545212233] [2024-11-11 16:49:17,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:17,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:17,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:17,771 INFO L87 Difference]: Start difference. First operand 5978 states and 7350 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:18,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:18,657 INFO L93 Difference]: Finished difference Result 14181 states and 17519 transitions. [2024-11-11 16:49:18,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:18,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 248 [2024-11-11 16:49:18,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:18,686 INFO L225 Difference]: With dead ends: 14181 [2024-11-11 16:49:18,686 INFO L226 Difference]: Without dead ends: 8573 [2024-11-11 16:49:18,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:18,695 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 163 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:18,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 330 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:49:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8573 states. [2024-11-11 16:49:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8573 to 8017. [2024-11-11 16:49:18,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8017 states, 8016 states have (on average 1.2169411177644711) internal successors, (9755), 8016 states have internal predecessors, (9755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8017 states to 8017 states and 9755 transitions. [2024-11-11 16:49:18,860 INFO L78 Accepts]: Start accepts. Automaton has 8017 states and 9755 transitions. Word has length 248 [2024-11-11 16:49:18,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:18,861 INFO L471 AbstractCegarLoop]: Abstraction has 8017 states and 9755 transitions. [2024-11-11 16:49:18,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:18,862 INFO L276 IsEmpty]: Start isEmpty. Operand 8017 states and 9755 transitions. [2024-11-11 16:49:18,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2024-11-11 16:49:18,867 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:18,867 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-11 16:49:18,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:49:18,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:18,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2090947407, now seen corresponding path program 1 times [2024-11-11 16:49:18,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:18,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589712236] [2024-11-11 16:49:18,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:18,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:19,074 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2024-11-11 16:49:19,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:19,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589712236] [2024-11-11 16:49:19,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589712236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:19,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:19,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:19,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042002727] [2024-11-11 16:49:19,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:19,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:19,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:19,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:19,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:19,076 INFO L87 Difference]: Start difference. First operand 8017 states and 9755 transitions. Second operand has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:19,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:19,764 INFO L93 Difference]: Finished difference Result 17345 states and 21233 transitions. [2024-11-11 16:49:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:19,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 258 [2024-11-11 16:49:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:19,789 INFO L225 Difference]: With dead ends: 17345 [2024-11-11 16:49:19,789 INFO L226 Difference]: Without dead ends: 9698 [2024-11-11 16:49:19,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:19,800 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 146 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:19,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 199 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:19,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9698 states. [2024-11-11 16:49:19,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9698 to 9304. [2024-11-11 16:49:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9304 states, 9303 states have (on average 1.2159518434913468) internal successors, (11312), 9303 states have internal predecessors, (11312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:19,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9304 states to 9304 states and 11312 transitions. [2024-11-11 16:49:19,933 INFO L78 Accepts]: Start accepts. Automaton has 9304 states and 11312 transitions. Word has length 258 [2024-11-11 16:49:19,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:19,935 INFO L471 AbstractCegarLoop]: Abstraction has 9304 states and 11312 transitions. [2024-11-11 16:49:19,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.666666666666664) internal successors, (170), 3 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9304 states and 11312 transitions. [2024-11-11 16:49:19,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2024-11-11 16:49:19,941 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:19,942 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-11 16:49:19,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:49:19,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:19,945 INFO L85 PathProgramCache]: Analyzing trace with hash 973039469, now seen corresponding path program 1 times [2024-11-11 16:49:19,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:19,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571444888] [2024-11-11 16:49:19,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:19,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:20,083 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-11 16:49:20,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:20,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571444888] [2024-11-11 16:49:20,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571444888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:20,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:20,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:20,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640551531] [2024-11-11 16:49:20,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:20,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:20,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:20,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:20,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:20,087 INFO L87 Difference]: Start difference. First operand 9304 states and 11312 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:20,738 INFO L93 Difference]: Finished difference Result 18205 states and 22188 transitions. [2024-11-11 16:49:20,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:20,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 259 [2024-11-11 16:49:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:20,754 INFO L225 Difference]: With dead ends: 18205 [2024-11-11 16:49:20,754 INFO L226 Difference]: Without dead ends: 9271 [2024-11-11 16:49:20,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:20,765 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 114 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:20,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 150 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:20,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9271 states. [2024-11-11 16:49:20,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9271 to 9086. [2024-11-11 16:49:20,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9086 states, 9085 states have (on average 1.1512383048981838) internal successors, (10459), 9085 states have internal predecessors, (10459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:20,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9086 states to 9086 states and 10459 transitions. [2024-11-11 16:49:20,879 INFO L78 Accepts]: Start accepts. Automaton has 9086 states and 10459 transitions. Word has length 259 [2024-11-11 16:49:20,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:20,880 INFO L471 AbstractCegarLoop]: Abstraction has 9086 states and 10459 transitions. [2024-11-11 16:49:20,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:20,880 INFO L276 IsEmpty]: Start isEmpty. Operand 9086 states and 10459 transitions. [2024-11-11 16:49:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-11 16:49:20,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:20,887 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:49:20,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:49:20,887 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:20,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash 585798969, now seen corresponding path program 1 times [2024-11-11 16:49:20,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:20,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523281792] [2024-11-11 16:49:20,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:20,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-11 16:49:21,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:21,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523281792] [2024-11-11 16:49:21,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523281792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:21,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:21,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:21,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714995305] [2024-11-11 16:49:21,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:21,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:21,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:21,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:21,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:21,208 INFO L87 Difference]: Start difference. First operand 9086 states and 10459 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:21,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:21,933 INFO L93 Difference]: Finished difference Result 18358 states and 21126 transitions. [2024-11-11 16:49:21,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:21,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2024-11-11 16:49:21,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:21,948 INFO L225 Difference]: With dead ends: 18358 [2024-11-11 16:49:21,948 INFO L226 Difference]: Without dead ends: 9458 [2024-11-11 16:49:21,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:21,957 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 145 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:21,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 374 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 574 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:21,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9458 states. [2024-11-11 16:49:22,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9458 to 9453. [2024-11-11 16:49:22,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9453 states, 9452 states have (on average 1.1241007194244603) internal successors, (10625), 9452 states have internal predecessors, (10625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9453 states to 9453 states and 10625 transitions. [2024-11-11 16:49:22,064 INFO L78 Accepts]: Start accepts. Automaton has 9453 states and 10625 transitions. Word has length 289 [2024-11-11 16:49:22,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:22,065 INFO L471 AbstractCegarLoop]: Abstraction has 9453 states and 10625 transitions. [2024-11-11 16:49:22,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:22,097 INFO L276 IsEmpty]: Start isEmpty. Operand 9453 states and 10625 transitions. [2024-11-11 16:49:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-11 16:49:22,107 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:22,108 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-11 16:49:22,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:49:22,109 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:22,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash 844810203, now seen corresponding path program 1 times [2024-11-11 16:49:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:22,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376508117] [2024-11-11 16:49:22,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-11 16:49:22,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:22,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376508117] [2024-11-11 16:49:22,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376508117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:22,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:22,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:22,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670271493] [2024-11-11 16:49:22,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:22,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:22,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:22,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:22,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:22,507 INFO L87 Difference]: Start difference. First operand 9453 states and 10625 transitions. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:23,205 INFO L93 Difference]: Finished difference Result 21307 states and 24061 transitions. [2024-11-11 16:49:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:23,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 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 319 [2024-11-11 16:49:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:23,226 INFO L225 Difference]: With dead ends: 21307 [2024-11-11 16:49:23,226 INFO L226 Difference]: Without dead ends: 12224 [2024-11-11 16:49:23,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:23,237 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 141 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:23,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 124 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:23,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12224 states. [2024-11-11 16:49:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12224 to 12222. [2024-11-11 16:49:23,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12222 states, 12221 states have (on average 1.116111611161116) internal successors, (13640), 12221 states have internal predecessors, (13640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:23,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12222 states to 12222 states and 13640 transitions. [2024-11-11 16:49:23,417 INFO L78 Accepts]: Start accepts. Automaton has 12222 states and 13640 transitions. Word has length 319 [2024-11-11 16:49:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:23,417 INFO L471 AbstractCegarLoop]: Abstraction has 12222 states and 13640 transitions. [2024-11-11 16:49:23,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 12222 states and 13640 transitions. [2024-11-11 16:49:23,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-11 16:49:23,427 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:23,428 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-11 16:49:23,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:49:23,428 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:23,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:23,430 INFO L85 PathProgramCache]: Analyzing trace with hash -235094284, now seen corresponding path program 1 times [2024-11-11 16:49:23,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:23,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726608009] [2024-11-11 16:49:23,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:23,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:24,335 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 242 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:24,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:24,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726608009] [2024-11-11 16:49:24,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726608009] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:49:24,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368071197] [2024-11-11 16:49:24,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:24,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:49:24,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:49:24,339 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:49:24,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 16:49:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:24,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 16:49:24,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:49:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-11 16:49:24,810 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 16:49:24,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368071197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:24,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 16:49:24,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-11 16:49:24,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568291547] [2024-11-11 16:49:24,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:24,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:24,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:24,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:24,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:49:24,813 INFO L87 Difference]: Start difference. First operand 12222 states and 13640 transitions. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:25,475 INFO L93 Difference]: Finished difference Result 25383 states and 28427 transitions. [2024-11-11 16:49:25,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:25,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 329 [2024-11-11 16:49:25,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:25,497 INFO L225 Difference]: With dead ends: 25383 [2024-11-11 16:49:25,497 INFO L226 Difference]: Without dead ends: 13531 [2024-11-11 16:49:25,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-11 16:49:25,509 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 137 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:25,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 342 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 566 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:25,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13531 states. [2024-11-11 16:49:25,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13531 to 13522. [2024-11-11 16:49:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13522 states, 13521 states have (on average 1.1178167295318393) internal successors, (15114), 13521 states have internal predecessors, (15114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:25,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13522 states to 13522 states and 15114 transitions. [2024-11-11 16:49:25,708 INFO L78 Accepts]: Start accepts. Automaton has 13522 states and 15114 transitions. Word has length 329 [2024-11-11 16:49:25,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:25,709 INFO L471 AbstractCegarLoop]: Abstraction has 13522 states and 15114 transitions. [2024-11-11 16:49:25,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:25,709 INFO L276 IsEmpty]: Start isEmpty. Operand 13522 states and 15114 transitions. [2024-11-11 16:49:25,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-11 16:49:25,719 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:25,720 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-11 16:49:25,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 16:49:25,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 16:49:25,924 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:25,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2086914279, now seen corresponding path program 1 times [2024-11-11 16:49:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:25,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930745788] [2024-11-11 16:49:25,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:25,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-11 16:49:26,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:26,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930745788] [2024-11-11 16:49:26,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930745788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:26,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:26,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:26,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010829104] [2024-11-11 16:49:26,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:26,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:26,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:26,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:26,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:26,201 INFO L87 Difference]: Start difference. First operand 13522 states and 15114 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:26,617 INFO L93 Difference]: Finished difference Result 26663 states and 29835 transitions. [2024-11-11 16:49:26,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:26,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 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 338 [2024-11-11 16:49:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:26,636 INFO L225 Difference]: With dead ends: 26663 [2024-11-11 16:49:26,636 INFO L226 Difference]: Without dead ends: 13511 [2024-11-11 16:49:26,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:26,647 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 188 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:26,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 39 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-11 16:49:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13511 states. [2024-11-11 16:49:26,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13511 to 13506. [2024-11-11 16:49:26,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13506 states, 13505 states have (on average 1.117067752684191) internal successors, (15086), 13505 states have internal predecessors, (15086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13506 states to 13506 states and 15086 transitions. [2024-11-11 16:49:26,798 INFO L78 Accepts]: Start accepts. Automaton has 13506 states and 15086 transitions. Word has length 338 [2024-11-11 16:49:26,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:26,798 INFO L471 AbstractCegarLoop]: Abstraction has 13506 states and 15086 transitions. [2024-11-11 16:49:26,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 13506 states and 15086 transitions. [2024-11-11 16:49:26,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-11 16:49:26,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:26,808 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:26,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 16:49:26,808 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:26,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:26,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1537666383, now seen corresponding path program 1 times [2024-11-11 16:49:26,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:26,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764378430] [2024-11-11 16:49:26,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:26,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:27,230 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 341 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-11 16:49:27,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:27,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764378430] [2024-11-11 16:49:27,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764378430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:27,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:27,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:27,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812975028] [2024-11-11 16:49:27,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:27,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:49:27,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:27,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:49:27,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:27,235 INFO L87 Difference]: Start difference. First operand 13506 states and 15086 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:28,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:28,222 INFO L93 Difference]: Finished difference Result 28862 states and 32245 transitions. [2024-11-11 16:49:28,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:49:28,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 350 [2024-11-11 16:49:28,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:28,244 INFO L225 Difference]: With dead ends: 28862 [2024-11-11 16:49:28,244 INFO L226 Difference]: Without dead ends: 15726 [2024-11-11 16:49:28,256 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:28,257 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 215 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:28,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 138 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:49:28,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15726 states. [2024-11-11 16:49:28,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15726 to 15718. [2024-11-11 16:49:28,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15718 states, 15717 states have (on average 1.1105172742889864) internal successors, (17454), 15717 states have internal predecessors, (17454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:28,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15718 states to 15718 states and 17454 transitions. [2024-11-11 16:49:28,478 INFO L78 Accepts]: Start accepts. Automaton has 15718 states and 17454 transitions. Word has length 350 [2024-11-11 16:49:28,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:28,478 INFO L471 AbstractCegarLoop]: Abstraction has 15718 states and 17454 transitions. [2024-11-11 16:49:28,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:28,479 INFO L276 IsEmpty]: Start isEmpty. Operand 15718 states and 17454 transitions. [2024-11-11 16:49:28,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2024-11-11 16:49:28,489 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:28,489 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:49:28,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 16:49:28,489 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:28,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:28,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1164252215, now seen corresponding path program 1 times [2024-11-11 16:49:28,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:28,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82632510] [2024-11-11 16:49:28,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:29,184 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 298 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2024-11-11 16:49:29,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:29,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82632510] [2024-11-11 16:49:29,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82632510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:29,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:29,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:49:29,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416274079] [2024-11-11 16:49:29,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:29,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:49:29,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:29,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:49:29,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:29,186 INFO L87 Difference]: Start difference. First operand 15718 states and 17454 transitions. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:30,194 INFO L93 Difference]: Finished difference Result 32359 states and 35959 transitions. [2024-11-11 16:49:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:49:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 363 [2024-11-11 16:49:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:30,214 INFO L225 Difference]: With dead ends: 32359 [2024-11-11 16:49:30,215 INFO L226 Difference]: Without dead ends: 17011 [2024-11-11 16:49:30,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:30,227 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 302 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:30,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 143 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:49:30,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17011 states. [2024-11-11 16:49:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17011 to 16270. [2024-11-11 16:49:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16270 states, 16269 states have (on average 1.108980269223677) internal successors, (18042), 16269 states have internal predecessors, (18042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:30,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16270 states to 16270 states and 18042 transitions. [2024-11-11 16:49:30,545 INFO L78 Accepts]: Start accepts. Automaton has 16270 states and 18042 transitions. Word has length 363 [2024-11-11 16:49:30,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:30,546 INFO L471 AbstractCegarLoop]: Abstraction has 16270 states and 18042 transitions. [2024-11-11 16:49:30,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16270 states and 18042 transitions. [2024-11-11 16:49:30,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2024-11-11 16:49:30,560 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:30,561 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-11 16:49:30,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 16:49:30,561 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:30,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1462969262, now seen corresponding path program 1 times [2024-11-11 16:49:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:30,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169572483] [2024-11-11 16:49:30,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-11 16:49:31,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:31,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169572483] [2024-11-11 16:49:31,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169572483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:31,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:31,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:31,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920223391] [2024-11-11 16:49:31,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:31,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:49:31,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:31,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:49:31,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:31,096 INFO L87 Difference]: Start difference. First operand 16270 states and 18042 transitions. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:32,124 INFO L93 Difference]: Finished difference Result 43057 states and 47697 transitions. [2024-11-11 16:49:32,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:49:32,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 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 377 [2024-11-11 16:49:32,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:32,147 INFO L225 Difference]: With dead ends: 43057 [2024-11-11 16:49:32,147 INFO L226 Difference]: Without dead ends: 26233 [2024-11-11 16:49:32,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:32,159 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 247 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:32,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 62 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 16:49:32,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26233 states. [2024-11-11 16:49:32,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26233 to 24940. [2024-11-11 16:49:32,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24940 states, 24939 states have (on average 1.1017282168491118) internal successors, (27476), 24939 states have internal predecessors, (27476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:32,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24940 states to 24940 states and 27476 transitions. [2024-11-11 16:49:32,435 INFO L78 Accepts]: Start accepts. Automaton has 24940 states and 27476 transitions. Word has length 377 [2024-11-11 16:49:32,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:32,435 INFO L471 AbstractCegarLoop]: Abstraction has 24940 states and 27476 transitions. [2024-11-11 16:49:32,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:32,436 INFO L276 IsEmpty]: Start isEmpty. Operand 24940 states and 27476 transitions. [2024-11-11 16:49:32,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2024-11-11 16:49:32,449 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:32,450 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:49:32,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 16:49:32,450 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:32,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:32,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1797707710, now seen corresponding path program 1 times [2024-11-11 16:49:32,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:32,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104153702] [2024-11-11 16:49:32,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:32,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2024-11-11 16:49:32,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:32,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104153702] [2024-11-11 16:49:32,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104153702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:32,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:32,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:32,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590315360] [2024-11-11 16:49:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:32,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:32,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:32,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:32,820 INFO L87 Difference]: Start difference. First operand 24940 states and 27476 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:33,405 INFO L93 Difference]: Finished difference Result 28806 states and 31708 transitions. [2024-11-11 16:49:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:33,406 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2024-11-11 16:49:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:33,431 INFO L225 Difference]: With dead ends: 28806 [2024-11-11 16:49:33,431 INFO L226 Difference]: Without dead ends: 28804 [2024-11-11 16:49:33,441 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:33,442 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 166 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:33,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 132 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:49:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28804 states. [2024-11-11 16:49:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28804 to 25308. [2024-11-11 16:49:33,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25308 states, 25307 states have (on average 1.1021851661595605) internal successors, (27893), 25307 states have internal predecessors, (27893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:33,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25308 states to 25308 states and 27893 transitions. [2024-11-11 16:49:33,693 INFO L78 Accepts]: Start accepts. Automaton has 25308 states and 27893 transitions. Word has length 408 [2024-11-11 16:49:33,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:33,694 INFO L471 AbstractCegarLoop]: Abstraction has 25308 states and 27893 transitions. [2024-11-11 16:49:33,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 25308 states and 27893 transitions. [2024-11-11 16:49:33,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-11-11 16:49:33,709 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:33,710 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:33,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 16:49:33,710 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:33,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:33,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1512001580, now seen corresponding path program 1 times [2024-11-11 16:49:33,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:33,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388988213] [2024-11-11 16:49:33,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:33,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:33,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:33,984 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-11 16:49:33,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:33,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388988213] [2024-11-11 16:49:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388988213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:33,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:33,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:33,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021768489] [2024-11-11 16:49:33,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:33,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:33,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:33,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:33,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:33,986 INFO L87 Difference]: Start difference. First operand 25308 states and 27893 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:34,704 INFO L93 Difference]: Finished difference Result 54667 states and 60218 transitions. [2024-11-11 16:49:34,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:34,704 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 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 419 [2024-11-11 16:49:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:34,732 INFO L225 Difference]: With dead ends: 54667 [2024-11-11 16:49:34,732 INFO L226 Difference]: Without dead ends: 29913 [2024-11-11 16:49:34,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:34,748 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:34,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 68 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29913 states. [2024-11-11 16:49:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29913 to 29724. [2024-11-11 16:49:34,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29724 states, 29723 states have (on average 1.0919489957272146) internal successors, (32456), 29723 states have internal predecessors, (32456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29724 states to 29724 states and 32456 transitions. [2024-11-11 16:49:35,023 INFO L78 Accepts]: Start accepts. Automaton has 29724 states and 32456 transitions. Word has length 419 [2024-11-11 16:49:35,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:35,024 INFO L471 AbstractCegarLoop]: Abstraction has 29724 states and 32456 transitions. [2024-11-11 16:49:35,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:35,024 INFO L276 IsEmpty]: Start isEmpty. Operand 29724 states and 32456 transitions. [2024-11-11 16:49:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-11 16:49:35,033 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:35,033 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:35,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 16:49:35,033 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:35,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1594395410, now seen corresponding path program 1 times [2024-11-11 16:49:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:35,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007949939] [2024-11-11 16:49:35,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:35,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 681 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-11 16:49:35,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:35,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007949939] [2024-11-11 16:49:35,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007949939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:35,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:35,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:49:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191107522] [2024-11-11 16:49:35,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:35,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:49:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:35,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:49:35,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:35,808 INFO L87 Difference]: Start difference. First operand 29724 states and 32456 transitions. Second operand has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:36,985 INFO L93 Difference]: Finished difference Result 63687 states and 69564 transitions. [2024-11-11 16:49:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:49:36,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 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 427 [2024-11-11 16:49:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:37,031 INFO L225 Difference]: With dead ends: 63687 [2024-11-11 16:49:37,031 INFO L226 Difference]: Without dead ends: 34701 [2024-11-11 16:49:37,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:37,054 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 253 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:37,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 87 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:49:37,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34701 states. [2024-11-11 16:49:37,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34701 to 30831. [2024-11-11 16:49:37,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30831 states, 30830 states have (on average 1.0880960103795005) internal successors, (33546), 30830 states have internal predecessors, (33546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30831 states to 30831 states and 33546 transitions. [2024-11-11 16:49:37,380 INFO L78 Accepts]: Start accepts. Automaton has 30831 states and 33546 transitions. Word has length 427 [2024-11-11 16:49:37,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:37,381 INFO L471 AbstractCegarLoop]: Abstraction has 30831 states and 33546 transitions. [2024-11-11 16:49:37,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.5) internal successors, (374), 4 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 30831 states and 33546 transitions. [2024-11-11 16:49:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2024-11-11 16:49:37,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:37,389 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-11 16:49:37,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 16:49:37,389 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:37,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:37,390 INFO L85 PathProgramCache]: Analyzing trace with hash 974136964, now seen corresponding path program 1 times [2024-11-11 16:49:37,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:37,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693018950] [2024-11-11 16:49:37,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:37,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:38,085 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 249 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:38,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:38,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693018950] [2024-11-11 16:49:38,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693018950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:49:38,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111821098] [2024-11-11 16:49:38,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:38,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:49:38,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:49:38,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:49:38,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 16:49:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:38,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 564 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 16:49:38,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:49:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 230 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:39,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:49:41,337 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 303 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:41,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111821098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:49:41,338 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:49:41,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-11-11 16:49:41,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687708421] [2024-11-11 16:49:41,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:49:41,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 16:49:41,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:41,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 16:49:41,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-11 16:49:41,341 INFO L87 Difference]: Start difference. First operand 30831 states and 33546 transitions. Second operand has 12 states, 12 states have (on average 102.83333333333333) internal successors, (1234), 11 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:46,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:46,363 INFO L93 Difference]: Finished difference Result 76957 states and 83699 transitions. [2024-11-11 16:49:46,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-11 16:49:46,363 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 102.83333333333333) internal successors, (1234), 11 states have internal predecessors, (1234), 0 states have call successors, (0), 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 430 [2024-11-11 16:49:46,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:46,403 INFO L225 Difference]: With dead ends: 76957 [2024-11-11 16:49:46,404 INFO L226 Difference]: Without dead ends: 46312 [2024-11-11 16:49:46,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 881 GetRequests, 853 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=252, Invalid=618, Unknown=0, NotChecked=0, Total=870 [2024-11-11 16:49:46,419 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 2398 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 5431 mSolverCounterSat, 1313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2398 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 6744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1313 IncrementalHoareTripleChecker+Valid, 5431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:46,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2398 Valid, 219 Invalid, 6744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1313 Valid, 5431 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-11 16:49:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46312 states. [2024-11-11 16:49:46,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46312 to 29359. [2024-11-11 16:49:46,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29359 states, 29358 states have (on average 1.077287281149942) internal successors, (31627), 29358 states have internal predecessors, (31627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:46,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29359 states to 29359 states and 31627 transitions. [2024-11-11 16:49:46,751 INFO L78 Accepts]: Start accepts. Automaton has 29359 states and 31627 transitions. Word has length 430 [2024-11-11 16:49:46,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:46,751 INFO L471 AbstractCegarLoop]: Abstraction has 29359 states and 31627 transitions. [2024-11-11 16:49:46,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 102.83333333333333) internal successors, (1234), 11 states have internal predecessors, (1234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:46,752 INFO L276 IsEmpty]: Start isEmpty. Operand 29359 states and 31627 transitions. [2024-11-11 16:49:46,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-11-11 16:49:46,758 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:46,758 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-11 16:49:46,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-11 16:49:46,958 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,SelfDestructingSolverStorable20 [2024-11-11 16:49:46,959 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:46,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:46,959 INFO L85 PathProgramCache]: Analyzing trace with hash -742651351, now seen corresponding path program 1 times [2024-11-11 16:49:46,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:46,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100007319] [2024-11-11 16:49:46,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:46,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:47,199 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 349 trivial. 0 not checked. [2024-11-11 16:49:47,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:47,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100007319] [2024-11-11 16:49:47,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100007319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:47,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:47,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:47,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111439782] [2024-11-11 16:49:47,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:47,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:47,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:47,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:47,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:47,201 INFO L87 Difference]: Start difference. First operand 29359 states and 31627 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:47,777 INFO L93 Difference]: Finished difference Result 34145 states and 36690 transitions. [2024-11-11 16:49:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:47,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 444 [2024-11-11 16:49:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:47,809 INFO L225 Difference]: With dead ends: 34145 [2024-11-11 16:49:47,809 INFO L226 Difference]: Without dead ends: 34143 [2024-11-11 16:49:47,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:47,822 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 168 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:47,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 131 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-11 16:49:47,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34143 states. [2024-11-11 16:49:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34143 to 28991. [2024-11-11 16:49:48,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28991 states, 28990 states have (on average 1.0777854432562952) internal successors, (31245), 28990 states have internal predecessors, (31245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28991 states to 28991 states and 31245 transitions. [2024-11-11 16:49:48,320 INFO L78 Accepts]: Start accepts. Automaton has 28991 states and 31245 transitions. Word has length 444 [2024-11-11 16:49:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:48,321 INFO L471 AbstractCegarLoop]: Abstraction has 28991 states and 31245 transitions. [2024-11-11 16:49:48,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 28991 states and 31245 transitions. [2024-11-11 16:49:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2024-11-11 16:49:48,334 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:48,334 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:48,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 16:49:48,335 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:48,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:48,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1644491105, now seen corresponding path program 1 times [2024-11-11 16:49:48,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:48,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115792373] [2024-11-11 16:49:48,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:48,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:49,272 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-11 16:49:49,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:49,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115792373] [2024-11-11 16:49:49,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115792373] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:49:49,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334353824] [2024-11-11 16:49:49,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:49,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:49:49,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:49:49,274 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:49:49,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 16:49:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:49,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-11 16:49:49,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:49:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-11 16:49:50,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:49:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 464 proven. 222 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-11 16:49:52,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334353824] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:49:52,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:49:52,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-11 16:49:52,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40620482] [2024-11-11 16:49:52,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:49:52,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 16:49:52,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:52,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 16:49:52,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-11 16:49:52,492 INFO L87 Difference]: Start difference. First operand 28991 states and 31245 transitions. Second operand has 11 states, 11 states have (on average 64.27272727272727) internal successors, (707), 10 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:56,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:56,154 INFO L93 Difference]: Finished difference Result 60967 states and 65570 transitions. [2024-11-11 16:49:56,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 16:49:56,155 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 64.27272727272727) internal successors, (707), 10 states have internal predecessors, (707), 0 states have call successors, (0), 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 505 [2024-11-11 16:49:56,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:56,191 INFO L225 Difference]: With dead ends: 60967 [2024-11-11 16:49:56,191 INFO L226 Difference]: Without dead ends: 32346 [2024-11-11 16:49:56,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1032 GetRequests, 1005 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=536, Unknown=0, NotChecked=0, Total=812 [2024-11-11 16:49:56,212 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2613 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 4313 mSolverCounterSat, 853 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2613 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 5166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 853 IncrementalHoareTripleChecker+Valid, 4313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:56,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2613 Valid, 124 Invalid, 5166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [853 Valid, 4313 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-11 16:49:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32346 states. [2024-11-11 16:49:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32346 to 18833. [2024-11-11 16:49:56,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18833 states, 18832 states have (on average 1.0752973661852168) internal successors, (20250), 18832 states have internal predecessors, (20250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:56,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18833 states to 18833 states and 20250 transitions. [2024-11-11 16:49:56,535 INFO L78 Accepts]: Start accepts. Automaton has 18833 states and 20250 transitions. Word has length 505 [2024-11-11 16:49:56,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:56,535 INFO L471 AbstractCegarLoop]: Abstraction has 18833 states and 20250 transitions. [2024-11-11 16:49:56,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.27272727272727) internal successors, (707), 10 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:56,536 INFO L276 IsEmpty]: Start isEmpty. Operand 18833 states and 20250 transitions. [2024-11-11 16:49:56,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2024-11-11 16:49:56,546 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:56,546 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:56,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 16:49:56,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:49:56,747 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:56,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1592139152, now seen corresponding path program 1 times [2024-11-11 16:49:56,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:56,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601521676] [2024-11-11 16:49:56,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:56,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:56,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:57,679 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 410 proven. 206 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-11 16:49:57,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:57,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601521676] [2024-11-11 16:49:57,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601521676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 16:49:57,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467727730] [2024-11-11 16:49:57,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:57,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:49:57,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:49:57,682 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 16:49:57,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 16:49:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:57,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-11 16:49:57,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 16:49:58,963 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 356 proven. 260 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-11 16:49:58,963 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 16:50:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 547 proven. 69 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-11 16:50:00,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467727730] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 16:50:00,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 16:50:00,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-11 16:50:00,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867566211] [2024-11-11 16:50:00,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 16:50:00,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 16:50:00,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:50:00,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 16:50:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-11-11 16:50:00,147 INFO L87 Difference]: Start difference. First operand 18833 states and 20250 transitions. Second operand has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:03,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:50:03,298 INFO L93 Difference]: Finished difference Result 47624 states and 51281 transitions. [2024-11-11 16:50:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 16:50:03,299 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 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 541 [2024-11-11 16:50:03,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:50:03,300 INFO L225 Difference]: With dead ends: 47624 [2024-11-11 16:50:03,300 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:50:03,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1085 GetRequests, 1076 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2024-11-11 16:50:03,317 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 914 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 4182 mSolverCounterSat, 735 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 4917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 735 IncrementalHoareTripleChecker+Valid, 4182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-11 16:50:03,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 147 Invalid, 4917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [735 Valid, 4182 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-11 16:50:03,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:50:03,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:50:03,318 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-11-11 16:50:03,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:50:03,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 541 [2024-11-11 16:50:03,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:50:03,319 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:50:03,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 85.3) internal successors, (853), 10 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:50:03,320 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:50:03,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:50:03,323 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:50:03,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 16:50:03,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 16:50:03,527 INFO L421 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] [2024-11-11 16:50:03,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:50:12,315 WARN L286 SmtUtils]: Spent 8.78s on a formula simplification. DAG size of input: 840 DAG size of output: 852 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2024-11-11 16:50:17,725 WARN L286 SmtUtils]: Spent 5.40s on a formula simplification. DAG size of input: 852 DAG size of output: 144 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2024-11-11 16:50:17,733 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:50:17,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:50:17 BoogieIcfgContainer [2024-11-11 16:50:17,780 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:50:17,781 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:50:17,781 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:50:17,781 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:50:17,781 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:49:08" (3/4) ... [2024-11-11 16:50:17,785 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:50:17,812 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:50:17,813 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:50:17,815 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:50:17,816 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:50:17,992 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:50:17,994 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:50:17,994 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:50:17,995 INFO L158 Benchmark]: Toolchain (without parser) took 72515.37ms. Allocated memory was 159.4MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 105.8MB in the beginning and 1.1GB in the end (delta: -999.5MB). Peak memory consumption was 963.5MB. Max. memory is 16.1GB. [2024-11-11 16:50:17,996 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 64.3MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:50:17,996 INFO L158 Benchmark]: CACSL2BoogieTranslator took 821.67ms. Allocated memory is still 159.4MB. Free memory was 105.2MB in the beginning and 102.2MB in the end (delta: 3.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-11 16:50:17,996 INFO L158 Benchmark]: Boogie Procedure Inliner took 129.88ms. Allocated memory is still 159.4MB. Free memory was 101.1MB in the beginning and 84.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:50:17,996 INFO L158 Benchmark]: Boogie Preprocessor took 176.38ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 59.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-11 16:50:17,997 INFO L158 Benchmark]: RCFGBuilder took 1679.23ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 59.2MB in the beginning and 110.3MB in the end (delta: -51.1MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. [2024-11-11 16:50:17,999 INFO L158 Benchmark]: TraceAbstraction took 69488.00ms. Allocated memory was 218.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 109.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-11 16:50:17,999 INFO L158 Benchmark]: Witness Printer took 213.49ms. Allocated memory is still 2.1GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:50:18,000 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.18ms. Allocated memory is still 100.7MB. Free memory was 64.4MB in the beginning and 64.3MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 821.67ms. Allocated memory is still 159.4MB. Free memory was 105.2MB in the beginning and 102.2MB in the end (delta: 3.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 129.88ms. Allocated memory is still 159.4MB. Free memory was 101.1MB in the beginning and 84.3MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 176.38ms. Allocated memory is still 159.4MB. Free memory was 84.3MB in the beginning and 59.2MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1679.23ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 59.2MB in the beginning and 110.3MB in the end (delta: -51.1MB). Peak memory consumption was 45.0MB. Max. memory is 16.1GB. * TraceAbstraction took 69488.00ms. Allocated memory was 218.1MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 109.3MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 213.49ms. Allocated memory is still 2.1GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * 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: 184]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 55.2s, OverallIterations: 24, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 29.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9635 SdHoareTripleChecker+Valid, 25.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9635 mSDsluCounter, 4444 SdHoareTripleChecker+Invalid, 21.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 867 mSDsCounter, 5278 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27863 IncrementalHoareTripleChecker+Invalid, 33141 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5278 mSolverCounterUnsat, 3577 mSDtfsCounter, 27863 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3389 GetRequests, 3295 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30831occurred in iteration=20, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 46981 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 17.8s InterpolantComputationTime, 9308 NumberOfCodeBlocks, 9308 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 10753 ConstructedInterpolants, 0 QuantifiedInterpolants, 42568 SizeOfPredicates, 10 NumberOfNonLiveVariables, 2395 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 31 InterpolantComputations, 21 PerfectInterpolantSequences, 10167/12043 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: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((a4 == 0) && (a25 == 11)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= (((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) >= 0) ? (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) : ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) - 1)) + 110739))) || (((((a3 == 1) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) && (a25 == 10))) || (((((((a25 == 11) && (173 <= a23)) && (a3 == 1)) && (a4 == 1)) && (0 <= ((long long) a29 + 554195))) && (a23 <= 312)) && (a8 == 15))) || ((((((260 <= a29) && (a29 <= 275)) && (a25 == 12)) && (a4 == 0)) && (a3 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a4 == 0)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= (((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) >= 0) ? (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) : ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) - 1)) + 110739)))) || ((((((260 <= a29) && (a4 == 0)) && (a25 <= 10)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((141 <= a29) && ((((((a25 == 11) && (a29 <= 274)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) || ((((((a25 == 12) && (a29 <= 274)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15))))) || (((((((((long long) a29 + 22) <= 0) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (141 <= a23))) || (((((a25 == 11) && (((long long) 119992 + a23) <= 0)) && (a4 == 1)) && (a8 == 15)) && (245 <= a29))) || ((((((a25 == 12) && (a4 == 0)) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= (((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) >= 0) ? (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) : ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) - 1)) + 110739)))) || ((((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15))) || ((((((a25 == 12) && (a4 == 0)) && (a29 <= 274)) && (141 <= a29)) && (a3 == 1)) && (a8 == 15))) || ((((((a25 == 11) && (a4 == 1)) && (103953 <= a29)) || (((((a25 != 13) && (a25 != 12)) && (((a25 <= 10) && (115637 <= a29)) || (115952 < a29))) && (a4 == 1)) && (a23 <= 312))) && (a3 == 1)) && (a8 == 15))) || ((((((((a25 <= 10) && (173 <= a23)) && (a4 == 1)) && (a23 <= 312)) || ((a4 == 1) && (a25 == 10))) && (a3 == 1)) && (a8 == 15)) && (0 <= (((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) >= 0) ? (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) : ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) - 1)) + 110739)))) || ((((((a25 == 13) && (a29 <= 274)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a29 <= 275) && (256 <= a29)) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 != 13) || (a29 < 278)) && (a25 != 12)) && ((((((a25 == 13) && (a29 <= 220)) && (((long long) 119992 + a23) <= 0)) && (a8 == 15)) || ((((260 <= a29) && (a25 <= 10)) && (((long long) 119992 + a23) <= 0)) && (a8 == 15))) || (((((long long) 119992 + a23) <= 0) && (a8 == 15)) && (115953 <= a29)))) && (a4 == 1)) && (130 <= a29))) || (((((a25 <= 10) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 == 13) && (a3 == 1)) && (a29 <= 220)) && (0 <= ((long long) 7792 + a29))) && (a4 == 1)) && (a8 == 15)) && (141 <= a23))) || (((((((a4 == 0) && (a25 <= 10)) && (a3 == 1)) && (a29 <= 220)) && (a23 <= 312)) && (a8 == 15)) && (0 <= (((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) >= 0) ? (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) : ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) - 1)) + 110739)))) || (((((((260 <= a29) && (a25 == 12)) && (a29 <= 277)) && (173 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 != 13) && (300138 <= a29)) && (a25 != 12)) && (a3 == 1)) && (a29 <= 600297)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 != 13) && (a25 != 12)) && (a29 <= 599998)) && (a3 == 1)) && (((a25 <= 10) && (115637 <= a29)) || (115952 < a29))) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 12) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (141 <= a23))) || ((((((a4 == 0) && (a3 == 1)) && (a29 <= 220)) && (a8 == 15)) && (a25 == 10)) && (0 <= (((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) >= 0) ? (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) : ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) - 1)) + 110739)))) || (((((((a25 == 12) && (a4 == 0)) && (((long long) a29 + 580291) <= 0)) && (a3 == 1)) && (a8 == 15)) && ((4 < ((a29 >= 0) ? (a29 % 15) : ((a29 % 15) + 15))) || (((a29 >= 0) ? (a29 % 15) : ((a29 % 15) + 15)) == 0))) && (0 <= (((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) >= 0) ? (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) : ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) - 1)) + 110739)))) || ((((((long long) 119992 + a23) <= 0) && (a4 == 1)) && (a8 == 15)) && (a25 == 10))) || ((((((a25 == 13) && (173 <= a23)) && (a29 <= 599998)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 12) && (((long long) a29 + 22) <= 0)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (0 <= (((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) >= 0) ? (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) : ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) - 1)) + 110739)))) || ((((((260 <= a29) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (141 <= a23))) || ((((((a4 == 0) && (a3 == 1)) && (a23 <= 312)) && (a8 == 15)) && (a25 == 10)) && (0 <= (((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) >= 0) ? (((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) : ((((((((long long) a29 * 3) + -554771) >= 0) ? ((((long long) a29 * 3) + -554771) / 5) : (((((long long) a29 * 3) + -554771) / 5) - 1)) + 25349) / 5) - 1)) + 110739)))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:50:18,032 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 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE