./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label14.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 6b9a8cf062c769ab6372057423b232460c4eac80bd30ee0857d87935f050ecf1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:08:47,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:08:48,004 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:08:48,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:08:48,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:08:48,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:08:48,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:08:48,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:08:48,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:08:48,054 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:08:48,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:08:48,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:08:48,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:08:48,057 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:08:48,057 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:08:48,058 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:08:48,058 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:08:48,058 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:08:48,061 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:08:48,062 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:08:48,062 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:08:48,062 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:08:48,063 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:08:48,063 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:08:48,063 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:08:48,063 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:08:48,063 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:08:48,064 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:08:48,064 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:08:48,064 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:08:48,065 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:08:48,065 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:08:48,065 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:08:48,065 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:08:48,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:08:48,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:08:48,070 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:08:48,070 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:08:48,071 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:08:48,071 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:08:48,071 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:08:48,072 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:08:48,072 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 -> 6b9a8cf062c769ab6372057423b232460c4eac80bd30ee0857d87935f050ecf1 [2024-10-12 16:08:48,334 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:08:48,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:08:48,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:08:48,366 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:08:48,367 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:08:48,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label14.c [2024-10-12 16:08:49,819 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:08:50,262 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:08:50,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label14.c [2024-10-12 16:08:50,308 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1532238/93f793a6262f40abbde2dd49ac442f39/FLAG527b5f984 [2024-10-12 16:08:50,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc1532238/93f793a6262f40abbde2dd49ac442f39 [2024-10-12 16:08:50,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:08:50,400 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:08:50,401 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:08:50,401 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:08:50,407 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:08:50,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:08:50" (1/1) ... [2024-10-12 16:08:50,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233a4756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:50, skipping insertion in model container [2024-10-12 16:08:50,409 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:08:50" (1/1) ... [2024-10-12 16:08:50,541 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:08:50,839 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label14.c[5911,5924] [2024-10-12 16:08:51,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:08:51,619 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:08:51,642 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label14.c[5911,5924] [2024-10-12 16:08:52,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:08:52,240 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:08:52,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52 WrapperNode [2024-10-12 16:08:52,241 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:08:52,242 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:08:52,243 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:08:52,243 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:08:52,249 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:52,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:52,833 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-10-12 16:08:52,834 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:08:52,835 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:08:52,835 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:08:52,835 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:08:52,845 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:52,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:53,026 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:53,229 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 16:08:53,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:53,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:53,406 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:53,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:53,463 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:53,488 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:53,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:08:53,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:08:53,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:08:53,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:08:53,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (1/1) ... [2024-10-12 16:08:53,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:08:53,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:08:53,581 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:08:53,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:08:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:08:53,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:08:53,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:08:53,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:08:53,709 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:08:53,711 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:08:59,430 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-10-12 16:08:59,430 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:08:59,508 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:08:59,508 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:08:59,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:08:59 BoogieIcfgContainer [2024-10-12 16:08:59,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:08:59,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:08:59,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:08:59,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:08:59,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:08:50" (1/3) ... [2024-10-12 16:08:59,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efc48ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:08:59, skipping insertion in model container [2024-10-12 16:08:59,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:08:52" (2/3) ... [2024-10-12 16:08:59,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efc48ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:08:59, skipping insertion in model container [2024-10-12 16:08:59,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:08:59" (3/3) ... [2024-10-12 16:08:59,517 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label14.c [2024-10-12 16:08:59,532 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:08:59,532 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-12 16:08:59,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:08:59,633 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;@5b6c6286, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:08:59,633 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-12 16:08:59,641 INFO L276 IsEmpty]: Start isEmpty. Operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:08:59,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 16:08:59,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:08:59,647 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:08:59,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:08:59,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:08:59,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1745199143, now seen corresponding path program 1 times [2024-10-12 16:08:59,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:08:59,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212944214] [2024-10-12 16:08:59,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:08:59,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:08:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:08:59,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:08:59,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:08:59,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212944214] [2024-10-12 16:08:59,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212944214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:08:59,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:08:59,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:08:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36914442] [2024-10-12 16:08:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:08:59,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-12 16:08:59,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:08:59,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-12 16:08:59,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:08:59,854 INFO L87 Difference]: Start difference. First operand has 1036 states, 1034 states have (on average 1.877176015473888) internal successors, (1941), 1035 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:08:59,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:08:59,962 INFO L93 Difference]: Finished difference Result 2071 states and 3881 transitions. [2024-10-12 16:08:59,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-12 16:08:59,969 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-12 16:08:59,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:08:59,993 INFO L225 Difference]: With dead ends: 2071 [2024-10-12 16:08:59,993 INFO L226 Difference]: Without dead ends: 1034 [2024-10-12 16:08:59,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-12 16:09:00,002 INFO L432 NwaCegarLoop]: 1876 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:00,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1876 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:09:00,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2024-10-12 16:09:00,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 1034. [2024-10-12 16:09:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 1.8160696999031947) internal successors, (1876), 1033 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 1876 transitions. [2024-10-12 16:09:00,092 INFO L78 Accepts]: Start accepts. Automaton has 1034 states and 1876 transitions. Word has length 40 [2024-10-12 16:09:00,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:00,093 INFO L471 AbstractCegarLoop]: Abstraction has 1034 states and 1876 transitions. [2024-10-12 16:09:00,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:00,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1034 states and 1876 transitions. [2024-10-12 16:09:00,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-12 16:09:00,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:00,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:00,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:09:00,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:00,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:00,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1416322832, now seen corresponding path program 1 times [2024-10-12 16:09:00,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:00,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004304325] [2024-10-12 16:09:00,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:00,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:00,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:09:00,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:00,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004304325] [2024-10-12 16:09:00,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004304325] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:00,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:00,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:09:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756652892] [2024-10-12 16:09:00,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:00,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:09:00,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:00,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:09:00,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:09:00,525 INFO L87 Difference]: Start difference. First operand 1034 states and 1876 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:06,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:06,653 INFO L93 Difference]: Finished difference Result 3696 states and 6823 transitions. [2024-10-12 16:09:06,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:09:06,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 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 40 [2024-10-12 16:09:06,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:06,664 INFO L225 Difference]: With dead ends: 3696 [2024-10-12 16:09:06,665 INFO L226 Difference]: Without dead ends: 2663 [2024-10-12 16:09:06,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-12 16:09:06,667 INFO L432 NwaCegarLoop]: 717 mSDtfsCounter, 2680 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 4127 mSolverCounterSat, 1487 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2680 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 5614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1487 IncrementalHoareTripleChecker+Valid, 4127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:06,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2680 Valid, 1017 Invalid, 5614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1487 Valid, 4127 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-10-12 16:09:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2024-10-12 16:09:06,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2662. [2024-10-12 16:09:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2662 states, 2661 states have (on average 1.4611048478015785) internal successors, (3888), 2661 states have internal predecessors, (3888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2662 states to 2662 states and 3888 transitions. [2024-10-12 16:09:06,738 INFO L78 Accepts]: Start accepts. Automaton has 2662 states and 3888 transitions. Word has length 40 [2024-10-12 16:09:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:06,738 INFO L471 AbstractCegarLoop]: Abstraction has 2662 states and 3888 transitions. [2024-10-12 16:09:06,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:06,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2662 states and 3888 transitions. [2024-10-12 16:09:06,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-12 16:09:06,743 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:06,743 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:06,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:09:06,743 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:06,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:06,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1808941784, now seen corresponding path program 1 times [2024-10-12 16:09:06,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:06,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077117330] [2024-10-12 16:09:06,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:06,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:06,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:07,077 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-10-12 16:09:07,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:07,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077117330] [2024-10-12 16:09:07,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077117330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:07,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:07,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:07,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982826545] [2024-10-12 16:09:07,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:07,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:07,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:07,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:07,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:07,083 INFO L87 Difference]: Start difference. First operand 2662 states and 3888 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:10,798 INFO L93 Difference]: Finished difference Result 6141 states and 9711 transitions. [2024-10-12 16:09:10,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:10,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 165 [2024-10-12 16:09:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:10,813 INFO L225 Difference]: With dead ends: 6141 [2024-10-12 16:09:10,814 INFO L226 Difference]: Without dead ends: 4267 [2024-10-12 16:09:10,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:10,817 INFO L432 NwaCegarLoop]: 1037 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2507 mSolverCounterSat, 779 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 779 IncrementalHoareTripleChecker+Valid, 2507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:10,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1186 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [779 Valid, 2507 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 16:09:10,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2024-10-12 16:09:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4253. [2024-10-12 16:09:10,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4253 states, 4252 states have (on average 1.351128880526811) internal successors, (5745), 4252 states have internal predecessors, (5745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4253 states to 4253 states and 5745 transitions. [2024-10-12 16:09:10,890 INFO L78 Accepts]: Start accepts. Automaton has 4253 states and 5745 transitions. Word has length 165 [2024-10-12 16:09:10,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:10,891 INFO L471 AbstractCegarLoop]: Abstraction has 4253 states and 5745 transitions. [2024-10-12 16:09:10,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:10,891 INFO L276 IsEmpty]: Start isEmpty. Operand 4253 states and 5745 transitions. [2024-10-12 16:09:10,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-10-12 16:09:10,895 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:10,895 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:09:10,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:09:10,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:10,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:10,896 INFO L85 PathProgramCache]: Analyzing trace with hash 748562156, now seen corresponding path program 1 times [2024-10-12 16:09:10,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:10,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105821443] [2024-10-12 16:09:10,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:10,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:10,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-10-12 16:09:11,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:11,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105821443] [2024-10-12 16:09:11,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105821443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:11,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:11,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:11,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982160864] [2024-10-12 16:09:11,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:11,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:11,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:11,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:11,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:11,087 INFO L87 Difference]: Start difference. First operand 4253 states and 5745 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:14,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:14,331 INFO L93 Difference]: Finished difference Result 10896 states and 15267 transitions. [2024-10-12 16:09:14,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:14,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 207 [2024-10-12 16:09:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:14,363 INFO L225 Difference]: With dead ends: 10896 [2024-10-12 16:09:14,364 INFO L226 Difference]: Without dead ends: 7431 [2024-10-12 16:09:14,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:14,374 INFO L432 NwaCegarLoop]: 822 mSDtfsCounter, 905 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 755 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:14,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 953 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [755 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 16:09:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7431 states. [2024-10-12 16:09:14,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7431 to 7425. [2024-10-12 16:09:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7425 states, 7424 states have (on average 1.2883890086206897) internal successors, (9565), 7424 states have internal predecessors, (9565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7425 states to 7425 states and 9565 transitions. [2024-10-12 16:09:14,505 INFO L78 Accepts]: Start accepts. Automaton has 7425 states and 9565 transitions. Word has length 207 [2024-10-12 16:09:14,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:14,507 INFO L471 AbstractCegarLoop]: Abstraction has 7425 states and 9565 transitions. [2024-10-12 16:09:14,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 7425 states and 9565 transitions. [2024-10-12 16:09:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-12 16:09:14,512 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:14,512 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-12 16:09:14,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:09:14,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:14,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:14,514 INFO L85 PathProgramCache]: Analyzing trace with hash 248693903, now seen corresponding path program 1 times [2024-10-12 16:09:14,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:14,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072962830] [2024-10-12 16:09:14,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:14,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-12 16:09:14,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:14,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072962830] [2024-10-12 16:09:14,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072962830] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:14,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:14,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295690139] [2024-10-12 16:09:14,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:14,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:14,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:14,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:14,748 INFO L87 Difference]: Start difference. First operand 7425 states and 9565 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:18,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:18,045 INFO L93 Difference]: Finished difference Result 19618 states and 25892 transitions. [2024-10-12 16:09:18,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:18,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2024-10-12 16:09:18,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:18,091 INFO L225 Difference]: With dead ends: 19618 [2024-10-12 16:09:18,091 INFO L226 Difference]: Without dead ends: 12981 [2024-10-12 16:09:18,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:18,104 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 907 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2890 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 3430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:18,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 635 Invalid, 3430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2890 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-12 16:09:18,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2024-10-12 16:09:18,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 12974. [2024-10-12 16:09:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12974 states, 12973 states have (on average 1.2714098512294767) internal successors, (16494), 12973 states have internal predecessors, (16494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:18,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12974 states to 12974 states and 16494 transitions. [2024-10-12 16:09:18,350 INFO L78 Accepts]: Start accepts. Automaton has 12974 states and 16494 transitions. Word has length 221 [2024-10-12 16:09:18,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:18,351 INFO L471 AbstractCegarLoop]: Abstraction has 12974 states and 16494 transitions. [2024-10-12 16:09:18,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:18,351 INFO L276 IsEmpty]: Start isEmpty. Operand 12974 states and 16494 transitions. [2024-10-12 16:09:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2024-10-12 16:09:18,355 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:18,355 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:18,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:09:18,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:18,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:18,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1496443372, now seen corresponding path program 1 times [2024-10-12 16:09:18,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:18,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839761462] [2024-10-12 16:09:18,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:18,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:18,613 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-10-12 16:09:18,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:18,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839761462] [2024-10-12 16:09:18,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839761462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:18,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:18,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:18,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009937403] [2024-10-12 16:09:18,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:18,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:18,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:18,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:18,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:18,620 INFO L87 Difference]: Start difference. First operand 12974 states and 16494 transitions. Second operand has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:21,742 INFO L93 Difference]: Finished difference Result 36179 states and 46571 transitions. [2024-10-12 16:09:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 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-10-12 16:09:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:21,784 INFO L225 Difference]: With dead ends: 36179 [2024-10-12 16:09:21,785 INFO L226 Difference]: Without dead ends: 23993 [2024-10-12 16:09:21,802 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:21,803 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:21,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 984 Invalid, 3178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-12 16:09:21,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23993 states. [2024-10-12 16:09:22,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23993 to 22415. [2024-10-12 16:09:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22415 states, 22414 states have (on average 1.2108503613812795) internal successors, (27140), 22414 states have internal predecessors, (27140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22415 states to 22415 states and 27140 transitions. [2024-10-12 16:09:22,132 INFO L78 Accepts]: Start accepts. Automaton has 22415 states and 27140 transitions. Word has length 237 [2024-10-12 16:09:22,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:22,133 INFO L471 AbstractCegarLoop]: Abstraction has 22415 states and 27140 transitions. [2024-10-12 16:09:22,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.666666666666664) internal successors, (167), 2 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 22415 states and 27140 transitions. [2024-10-12 16:09:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2024-10-12 16:09:22,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:22,138 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:22,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:09:22,138 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:22,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:22,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1303245769, now seen corresponding path program 1 times [2024-10-12 16:09:22,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:22,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451165878] [2024-10-12 16:09:22,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:22,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:22,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:22,350 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 290 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-12 16:09:22,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:22,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451165878] [2024-10-12 16:09:22,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451165878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:22,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:22,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:09:22,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502081699] [2024-10-12 16:09:22,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:22,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:22,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:22,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:22,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:22,353 INFO L87 Difference]: Start difference. First operand 22415 states and 27140 transitions. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:25,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:25,763 INFO L93 Difference]: Finished difference Result 55857 states and 69053 transitions. [2024-10-12 16:09:25,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:25,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 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 280 [2024-10-12 16:09:25,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:25,818 INFO L225 Difference]: With dead ends: 55857 [2024-10-12 16:09:25,819 INFO L226 Difference]: Without dead ends: 34230 [2024-10-12 16:09:25,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:25,849 INFO L432 NwaCegarLoop]: 807 mSDtfsCounter, 887 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 3296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:25,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 924 Invalid, 3296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-12 16:09:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34230 states. [2024-10-12 16:09:26,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34230 to 33433. [2024-10-12 16:09:26,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33433 states, 33432 states have (on average 1.190416367552046) internal successors, (39798), 33432 states have internal predecessors, (39798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:26,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33433 states to 33433 states and 39798 transitions. [2024-10-12 16:09:26,249 INFO L78 Accepts]: Start accepts. Automaton has 33433 states and 39798 transitions. Word has length 280 [2024-10-12 16:09:26,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:26,249 INFO L471 AbstractCegarLoop]: Abstraction has 33433 states and 39798 transitions. [2024-10-12 16:09:26,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:26,250 INFO L276 IsEmpty]: Start isEmpty. Operand 33433 states and 39798 transitions. [2024-10-12 16:09:26,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-10-12 16:09:26,255 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:26,256 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:26,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:09:26,256 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:26,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:26,257 INFO L85 PathProgramCache]: Analyzing trace with hash -383115339, now seen corresponding path program 1 times [2024-10-12 16:09:26,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:26,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567801596] [2024-10-12 16:09:26,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:26,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:26,541 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 353 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-12 16:09:26,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:26,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567801596] [2024-10-12 16:09:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567801596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:26,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:26,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:09:26,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156383610] [2024-10-12 16:09:26,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:26,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:09:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:26,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:09:26,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:09:26,543 INFO L87 Difference]: Start difference. First operand 33433 states and 39798 transitions. Second operand has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:32,706 INFO L93 Difference]: Finished difference Result 117461 states and 141011 transitions. [2024-10-12 16:09:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:09:32,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 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 328 [2024-10-12 16:09:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:32,813 INFO L225 Difference]: With dead ends: 117461 [2024-10-12 16:09:32,813 INFO L226 Difference]: Without dead ends: 84816 [2024-10-12 16:09:32,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:09:32,866 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 1729 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 6677 mSolverCounterSat, 1117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1729 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 7794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1117 IncrementalHoareTripleChecker+Valid, 6677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:32,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1729 Valid, 730 Invalid, 7794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1117 Valid, 6677 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-10-12 16:09:32,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84816 states. [2024-10-12 16:09:33,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84816 to 84686. [2024-10-12 16:09:33,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84686 states, 84685 states have (on average 1.1720965932573655) internal successors, (99259), 84685 states have internal predecessors, (99259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84686 states to 84686 states and 99259 transitions. [2024-10-12 16:09:33,889 INFO L78 Accepts]: Start accepts. Automaton has 84686 states and 99259 transitions. Word has length 328 [2024-10-12 16:09:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:33,889 INFO L471 AbstractCegarLoop]: Abstraction has 84686 states and 99259 transitions. [2024-10-12 16:09:33,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.5) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 84686 states and 99259 transitions. [2024-10-12 16:09:33,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2024-10-12 16:09:33,897 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:33,897 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:33,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:09:33,897 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:33,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:33,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1419953172, now seen corresponding path program 1 times [2024-10-12 16:09:33,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:33,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132404545] [2024-10-12 16:09:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:33,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:33,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2024-10-12 16:09:34,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:34,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132404545] [2024-10-12 16:09:34,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132404545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:34,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:34,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:09:34,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273312037] [2024-10-12 16:09:34,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:34,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:34,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:34,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:34,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:34,268 INFO L87 Difference]: Start difference. First operand 84686 states and 99259 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:37,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:37,896 INFO L93 Difference]: Finished difference Result 158350 states and 186685 transitions. [2024-10-12 16:09:37,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:37,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 337 [2024-10-12 16:09:37,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:38,129 INFO L225 Difference]: With dead ends: 158350 [2024-10-12 16:09:38,130 INFO L226 Difference]: Without dead ends: 84695 [2024-10-12 16:09:38,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:38,162 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 728 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2706 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:38,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1199 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2706 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-12 16:09:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84695 states. [2024-10-12 16:09:39,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84695 to 84686. [2024-10-12 16:09:39,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84686 states, 84685 states have (on average 1.1713290429237764) internal successors, (99194), 84685 states have internal predecessors, (99194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:39,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84686 states to 84686 states and 99194 transitions. [2024-10-12 16:09:39,496 INFO L78 Accepts]: Start accepts. Automaton has 84686 states and 99194 transitions. Word has length 337 [2024-10-12 16:09:39,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:39,497 INFO L471 AbstractCegarLoop]: Abstraction has 84686 states and 99194 transitions. [2024-10-12 16:09:39,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 2 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:39,497 INFO L276 IsEmpty]: Start isEmpty. Operand 84686 states and 99194 transitions. [2024-10-12 16:09:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2024-10-12 16:09:39,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:39,504 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:39,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:09:39,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:39,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:39,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1156284566, now seen corresponding path program 1 times [2024-10-12 16:09:39,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:39,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6969260] [2024-10-12 16:09:39,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:39,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 249 proven. 110 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-12 16:09:40,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6969260] [2024-10-12 16:09:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6969260] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:09:40,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438030395] [2024-10-12 16:09:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:40,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:09:40,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:09:40,942 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:09:40,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-12 16:09:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:41,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:09:41,099 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:09:41,294 INFO L134 CoverageAnalysis]: Checked inductivity of 398 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-12 16:09:41,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:09:41,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438030395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:41,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:09:41,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-12 16:09:41,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432169991] [2024-10-12 16:09:41,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:41,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:41,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:41,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:41,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:09:41,297 INFO L87 Difference]: Start difference. First operand 84686 states and 99194 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:44,261 INFO L93 Difference]: Finished difference Result 168582 states and 197594 transitions. [2024-10-12 16:09:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:44,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 366 [2024-10-12 16:09:44,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:44,350 INFO L225 Difference]: With dead ends: 168582 [2024-10-12 16:09:44,351 INFO L226 Difference]: Without dead ends: 84684 [2024-10-12 16:09:44,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-12 16:09:44,567 INFO L432 NwaCegarLoop]: 1363 mSDtfsCounter, 1123 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1444 SdHoareTripleChecker+Invalid, 2919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:44,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1444 Invalid, 2919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-10-12 16:09:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84684 states. [2024-10-12 16:09:45,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84684 to 83896. [2024-10-12 16:09:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83896 states, 83895 states have (on average 1.1275522975147505) internal successors, (94596), 83895 states have internal predecessors, (94596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83896 states to 83896 states and 94596 transitions. [2024-10-12 16:09:45,647 INFO L78 Accepts]: Start accepts. Automaton has 83896 states and 94596 transitions. Word has length 366 [2024-10-12 16:09:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:45,647 INFO L471 AbstractCegarLoop]: Abstraction has 83896 states and 94596 transitions. [2024-10-12 16:09:45,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:45,648 INFO L276 IsEmpty]: Start isEmpty. Operand 83896 states and 94596 transitions. [2024-10-12 16:09:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2024-10-12 16:09:45,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:45,656 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:09:45,675 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-12 16:09:45,856 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,SelfDestructingSolverStorable9 [2024-10-12 16:09:45,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:45,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:45,858 INFO L85 PathProgramCache]: Analyzing trace with hash -457089687, now seen corresponding path program 1 times [2024-10-12 16:09:45,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732287327] [2024-10-12 16:09:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:45,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 484 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-10-12 16:09:46,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:46,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732287327] [2024-10-12 16:09:46,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732287327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:46,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:46,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:09:46,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542428832] [2024-10-12 16:09:46,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:46,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:46,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:46,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:46,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:46,304 INFO L87 Difference]: Start difference. First operand 83896 states and 94596 transitions. Second operand has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 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-10-12 16:09:51,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-12 16:09:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:52,227 INFO L93 Difference]: Finished difference Result 192984 states and 220100 transitions. [2024-10-12 16:09:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:52,228 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 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 396 [2024-10-12 16:09:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:52,350 INFO L225 Difference]: With dead ends: 192984 [2024-10-12 16:09:52,350 INFO L226 Difference]: Without dead ends: 109876 [2024-10-12 16:09:52,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:52,382 INFO L432 NwaCegarLoop]: 857 mSDtfsCounter, 891 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 3357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 933 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:52,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [891 Valid, 942 Invalid, 3357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [933 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-10-12 16:09:52,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109876 states. [2024-10-12 16:09:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109876 to 108282. [2024-10-12 16:09:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108282 states, 108281 states have (on average 1.131952974206001) internal successors, (122569), 108281 states have internal predecessors, (122569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:53,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108282 states to 108282 states and 122569 transitions. [2024-10-12 16:09:53,745 INFO L78 Accepts]: Start accepts. Automaton has 108282 states and 122569 transitions. Word has length 396 [2024-10-12 16:09:53,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:09:53,746 INFO L471 AbstractCegarLoop]: Abstraction has 108282 states and 122569 transitions. [2024-10-12 16:09:53,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.0) internal successors, (237), 3 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-10-12 16:09:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 108282 states and 122569 transitions. [2024-10-12 16:09:53,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2024-10-12 16:09:53,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:09:53,757 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-10-12 16:09:53,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:09:53,757 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:09:53,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:09:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1115855812, now seen corresponding path program 1 times [2024-10-12 16:09:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:09:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444832411] [2024-10-12 16:09:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:09:53,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:09:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:09:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-10-12 16:09:54,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:09:54,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444832411] [2024-10-12 16:09:54,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444832411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:09:54,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:09:54,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:09:54,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607043900] [2024-10-12 16:09:54,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:09:54,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:09:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:09:54,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:09:54,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:54,540 INFO L87 Difference]: Start difference. First operand 108282 states and 122569 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:09:58,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:09:58,835 INFO L93 Difference]: Finished difference Result 241762 states and 276112 transitions. [2024-10-12 16:09:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:09:58,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 434 [2024-10-12 16:09:58,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:09:58,990 INFO L225 Difference]: With dead ends: 241762 [2024-10-12 16:09:58,990 INFO L226 Difference]: Without dead ends: 134268 [2024-10-12 16:09:59,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:09:59,052 INFO L432 NwaCegarLoop]: 1785 mSDtfsCounter, 781 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 1935 SdHoareTripleChecker+Invalid, 3271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:09:59,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 1935 Invalid, 3271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-12 16:09:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134268 states. [2024-10-12 16:10:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134268 to 134251. [2024-10-12 16:10:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134251 states, 134250 states have (on average 1.1152551210428305) internal successors, (149723), 134250 states have internal predecessors, (149723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:10:01,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134251 states to 134251 states and 149723 transitions. [2024-10-12 16:10:01,101 INFO L78 Accepts]: Start accepts. Automaton has 134251 states and 149723 transitions. Word has length 434 [2024-10-12 16:10:01,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:10:01,102 INFO L471 AbstractCegarLoop]: Abstraction has 134251 states and 149723 transitions. [2024-10-12 16:10:01,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:10:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 134251 states and 149723 transitions. [2024-10-12 16:10:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 471 [2024-10-12 16:10:01,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:10:01,151 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:10:01,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:10:01,152 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:10:01,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:10:01,152 INFO L85 PathProgramCache]: Analyzing trace with hash -2129125583, now seen corresponding path program 1 times [2024-10-12 16:10:01,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:10:01,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895798335] [2024-10-12 16:10:01,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:01,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:10:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:03,103 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 315 proven. 113 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-12 16:10:03,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:10:03,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895798335] [2024-10-12 16:10:03,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895798335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-12 16:10:03,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449529392] [2024-10-12 16:10:03,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:10:03,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-12 16:10:03,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:10:03,106 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-12 16:10:03,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-12 16:10:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:10:03,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 16:10:03,311 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 16:10:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 354 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-10-12 16:10:03,517 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-12 16:10:03,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449529392] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:10:03,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-12 16:10:03,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-10-12 16:10:03,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602083366] [2024-10-12 16:10:03,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:10:03,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:10:03,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:10:03,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:10:03,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-12 16:10:03,519 INFO L87 Difference]: Start difference. First operand 134251 states and 149723 transitions. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)