./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2018/Problem11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2018/Problem11.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 940624650400628fbc547d76c7cce642a9063fb1576962b71733623b165f113e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 11:05:47,651 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 11:05:47,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 11:05:47,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 11:05:47,725 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 11:05:47,741 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 11:05:47,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 11:05:47,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 11:05:47,742 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 11:05:47,742 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 11:05:47,742 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 11:05:47,742 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 11:05:47,743 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 11:05:47,743 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 11:05:47,744 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 11:05:47,744 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 11:05:47,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 11:05:47,745 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 11:05:47,745 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 11:05:47,747 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 11:05:47,747 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 11:05:47,747 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 11:05:47,747 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 11:05:47,748 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 11:05:47,749 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 11:05:47,750 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 11:05:47,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 11:05:47,750 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 11:05:47,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 11:05:47,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 11:05:47,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 11:05:47,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 11:05:47,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:05:47,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 11:05:47,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 11:05:47,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 11:05:47,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 11:05:47,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 11:05:47,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 11:05:47,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 11:05:47,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 11:05:47,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 11:05:47,753 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 -> 940624650400628fbc547d76c7cce642a9063fb1576962b71733623b165f113e [2024-11-18 11:05:47,954 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 11:05:47,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 11:05:47,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 11:05:47,978 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 11:05:47,978 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 11:05:47,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2018/Problem11.c [2024-11-18 11:05:49,154 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 11:05:49,447 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 11:05:49,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c [2024-11-18 11:05:49,480 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba44dd55d/3b2a9f12a9964dd89ecaa9ef7bd39ae2/FLAG4a5f747f0 [2024-11-18 11:05:49,495 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba44dd55d/3b2a9f12a9964dd89ecaa9ef7bd39ae2 [2024-11-18 11:05:49,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 11:05:49,499 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 11:05:49,501 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 11:05:49,501 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 11:05:49,506 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 11:05:49,506 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:05:49" (1/1) ... [2024-11-18 11:05:49,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ebec3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:49, skipping insertion in model container [2024-11-18 11:05:49,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:05:49" (1/1) ... [2024-11-18 11:05:49,594 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 11:05:49,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c[778,791] [2024-11-18 11:05:49,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c[817,830] [2024-11-18 11:05:50,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:05:50,243 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 11:05:50,252 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c[778,791] [2024-11-18 11:05:50,254 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem11.c[817,830] [2024-11-18 11:05:50,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 11:05:50,480 INFO L204 MainTranslator]: Completed translation [2024-11-18 11:05:50,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50 WrapperNode [2024-11-18 11:05:50,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 11:05:50,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 11:05:50,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 11:05:50,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 11:05:50,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:50,527 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:50,659 INFO L138 Inliner]: procedures = 286, calls = 252, calls flagged for inlining = 148, calls inlined = 148, statements flattened = 1887 [2024-11-18 11:05:50,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 11:05:50,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 11:05:50,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 11:05:50,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 11:05:50,671 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:50,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:50,692 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:50,848 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 11:05:50,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:50,849 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:50,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:50,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:50,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:50,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:51,001 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 11:05:51,003 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 11:05:51,003 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 11:05:51,003 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 11:05:51,004 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (1/1) ... [2024-11-18 11:05:51,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 11:05:51,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 11:05:51,030 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 11:05:51,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 11:05:51,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 11:05:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2024-11-18 11:05:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2024-11-18 11:05:51,071 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2024-11-18 11:05:51,071 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2024-11-18 11:05:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 11:05:51,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 11:05:51,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 11:05:51,180 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 11:05:51,183 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 11:06:15,081 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-18 11:06:15,081 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 11:06:15,104 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 11:06:15,105 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 11:06:15,105 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:06:15 BoogieIcfgContainer [2024-11-18 11:06:15,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 11:06:15,106 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 11:06:15,107 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 11:06:15,109 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 11:06:15,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:05:49" (1/3) ... [2024-11-18 11:06:15,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578d3a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:06:15, skipping insertion in model container [2024-11-18 11:06:15,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:05:50" (2/3) ... [2024-11-18 11:06:15,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@578d3a63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:06:15, skipping insertion in model container [2024-11-18 11:06:15,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:06:15" (3/3) ... [2024-11-18 11:06:15,112 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11.c [2024-11-18 11:06:15,123 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 11:06:15,124 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-18 11:06:15,194 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 11:06:15,199 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;@1b8b262a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 11:06:15,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-18 11:06:15,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 513 states, 408 states have (on average 1.6274509803921569) internal successors, (664), 410 states have internal predecessors, (664), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-18 11:06:15,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-18 11:06:15,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:06:15,213 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 11:06:15,213 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:06:15,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:06:15,217 INFO L85 PathProgramCache]: Analyzing trace with hash -151746730, now seen corresponding path program 1 times [2024-11-18 11:06:15,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:06:15,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059255900] [2024-11-18 11:06:15,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:06:15,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:06:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:06:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:06:15,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:06:15,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059255900] [2024-11-18 11:06:15,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059255900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:06:15,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:06:15,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:06:15,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400007267] [2024-11-18 11:06:15,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:06:15,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 11:06:15,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:06:15,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 11:06:15,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 11:06:15,723 INFO L87 Difference]: Start difference. First operand has 513 states, 408 states have (on average 1.6274509803921569) internal successors, (664), 410 states have internal predecessors, (664), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:19,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:21,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:31,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:35,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:41,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:43,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:46,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:48,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:48,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:06:48,195 INFO L93 Difference]: Finished difference Result 1062 states and 1895 transitions. [2024-11-18 11:06:48,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 11:06:48,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-18 11:06:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:06:48,206 INFO L225 Difference]: With dead ends: 1062 [2024-11-18 11:06:48,206 INFO L226 Difference]: Without dead ends: 545 [2024-11-18 11:06:48,210 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-11-18 11:06:48,212 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 144 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 105 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 32.4s IncrementalHoareTripleChecker+Time [2024-11-18 11:06:48,212 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 852 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1153 Invalid, 2 Unknown, 0 Unchecked, 32.4s Time] [2024-11-18 11:06:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-18 11:06:48,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 540. [2024-11-18 11:06:48,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 438 states have (on average 1.6164383561643836) internal successors, (708), 537 states have internal predecessors, (708), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 808 transitions. [2024-11-18 11:06:48,266 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 808 transitions. Word has length 16 [2024-11-18 11:06:48,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:06:48,268 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 808 transitions. [2024-11-18 11:06:48,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 808 transitions. [2024-11-18 11:06:48,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 11:06:48,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:06:48,270 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] [2024-11-18 11:06:48,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 11:06:48,271 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:06:48,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:06:48,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1326248385, now seen corresponding path program 1 times [2024-11-18 11:06:48,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:06:48,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236269576] [2024-11-18 11:06:48,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:06:48,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:06:48,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:06:48,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:06:48,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:06:48,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236269576] [2024-11-18 11:06:48,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236269576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:06:48,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:06:48,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:06:48,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443758002] [2024-11-18 11:06:48,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:06:48,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:06:48,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:06:48,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:06:48,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:06:48,557 INFO L87 Difference]: Start difference. First operand 540 states and 808 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:49,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:49,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:06:49,919 INFO L93 Difference]: Finished difference Result 945 states and 1463 transitions. [2024-11-18 11:06:49,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:06:49,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-18 11:06:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:06:49,923 INFO L225 Difference]: With dead ends: 945 [2024-11-18 11:06:49,924 INFO L226 Difference]: Without dead ends: 541 [2024-11-18 11:06:49,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:06:49,927 INFO L432 NwaCegarLoop]: 654 mSDtfsCounter, 0 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-18 11:06:49,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-18 11:06:49,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-18 11:06:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2024-11-18 11:06:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 439 states have (on average 1.6150341685649203) internal successors, (709), 538 states have internal predecessors, (709), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 809 transitions. [2024-11-18 11:06:49,951 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 809 transitions. Word has length 24 [2024-11-18 11:06:49,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:06:49,952 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 809 transitions. [2024-11-18 11:06:49,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:49,952 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 809 transitions. [2024-11-18 11:06:49,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-18 11:06:49,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:06:49,954 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] [2024-11-18 11:06:49,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 11:06:49,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:06:49,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:06:49,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2006306755, now seen corresponding path program 1 times [2024-11-18 11:06:49,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:06:49,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166758023] [2024-11-18 11:06:49,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:06:49,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:06:49,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:06:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:06:50,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:06:50,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166758023] [2024-11-18 11:06:50,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166758023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:06:50,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:06:50,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:06:50,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864818379] [2024-11-18 11:06:50,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:06:50,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:06:50,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:06:50,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:06:50,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:06:50,031 INFO L87 Difference]: Start difference. First operand 541 states and 809 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:54,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:56,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:06:57,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:06:57,268 INFO L93 Difference]: Finished difference Result 1324 states and 2074 transitions. [2024-11-18 11:06:57,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:06:57,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-18 11:06:57,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:06:57,273 INFO L225 Difference]: With dead ends: 1324 [2024-11-18 11:06:57,273 INFO L226 Difference]: Without dead ends: 919 [2024-11-18 11:06:57,274 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-11-18 11:06:57,275 INFO L432 NwaCegarLoop]: 648 mSDtfsCounter, 580 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-18 11:06:57,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1254 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-11-18 11:06:57,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-18 11:06:57,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 823. [2024-11-18 11:06:57,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 721 states have (on average 1.6893203883495145) internal successors, (1218), 820 states have internal predecessors, (1218), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:57,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1318 transitions. [2024-11-18 11:06:57,293 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1318 transitions. Word has length 24 [2024-11-18 11:06:57,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:06:57,294 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1318 transitions. [2024-11-18 11:06:57,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:57,294 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1318 transitions. [2024-11-18 11:06:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-18 11:06:57,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:06:57,296 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] [2024-11-18 11:06:57,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 11:06:57,296 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:06:57,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:06:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2065250464, now seen corresponding path program 1 times [2024-11-18 11:06:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:06:57,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811494085] [2024-11-18 11:06:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:06:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:06:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:06:57,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:06:57,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:06:57,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811494085] [2024-11-18 11:06:57,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811494085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:06:57,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:06:57,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:06:57,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900534507] [2024-11-18 11:06:57,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:06:57,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:06:57,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:06:57,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:06:57,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:06:57,376 INFO L87 Difference]: Start difference. First operand 823 states and 1318 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:06:57,575 INFO L93 Difference]: Finished difference Result 1502 states and 2465 transitions. [2024-11-18 11:06:57,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:06:57,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-18 11:06:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:06:57,581 INFO L225 Difference]: With dead ends: 1502 [2024-11-18 11:06:57,582 INFO L226 Difference]: Without dead ends: 1489 [2024-11-18 11:06:57,582 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-11-18 11:06:57,585 INFO L432 NwaCegarLoop]: 661 mSDtfsCounter, 611 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 11:06:57,587 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1276 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 11:06:57,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2024-11-18 11:06:57,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1396. [2024-11-18 11:06:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1294 states have (on average 1.7349304482225656) internal successors, (2245), 1393 states have internal predecessors, (2245), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2345 transitions. [2024-11-18 11:06:57,619 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2345 transitions. Word has length 25 [2024-11-18 11:06:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:06:57,619 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2345 transitions. [2024-11-18 11:06:57,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:06:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2345 transitions. [2024-11-18 11:06:57,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 11:06:57,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:06:57,622 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] [2024-11-18 11:06:57,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 11:06:57,622 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:06:57,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:06:57,623 INFO L85 PathProgramCache]: Analyzing trace with hash -402454971, now seen corresponding path program 1 times [2024-11-18 11:06:57,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:06:57,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858922959] [2024-11-18 11:06:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:06:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:06:57,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:06:57,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:06:57,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:06:57,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858922959] [2024-11-18 11:06:57,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858922959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:06:57,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:06:57,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:06:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210694077] [2024-11-18 11:06:57,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:06:57,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:06:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:06:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:06:57,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:06:57,686 INFO L87 Difference]: Start difference. First operand 1396 states and 2345 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:01,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:07:08,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:07:09,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:07:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:07:10,084 INFO L93 Difference]: Finished difference Result 3819 states and 6580 transitions. [2024-11-18 11:07:10,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:07:10,085 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-18 11:07:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:07:10,093 INFO L225 Difference]: With dead ends: 3819 [2024-11-18 11:07:10,093 INFO L226 Difference]: Without dead ends: 2559 [2024-11-18 11:07:10,096 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-11-18 11:07:10,097 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 581 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2024-11-18 11:07:10,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1196 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 140 Invalid, 2 Unknown, 0 Unchecked, 12.4s Time] [2024-11-18 11:07:10,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2024-11-18 11:07:10,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2486. [2024-11-18 11:07:10,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2384 states have (on average 1.7638422818791946) internal successors, (4205), 2483 states have internal predecessors, (4205), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:10,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4305 transitions. [2024-11-18 11:07:10,137 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4305 transitions. Word has length 26 [2024-11-18 11:07:10,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:07:10,137 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4305 transitions. [2024-11-18 11:07:10,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:10,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4305 transitions. [2024-11-18 11:07:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-18 11:07:10,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:07:10,138 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] [2024-11-18 11:07:10,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 11:07:10,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:07:10,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:07:10,139 INFO L85 PathProgramCache]: Analyzing trace with hash -845354111, now seen corresponding path program 1 times [2024-11-18 11:07:10,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:07:10,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253790319] [2024-11-18 11:07:10,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:07:10,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:07:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:07:10,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:07:10,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:07:10,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253790319] [2024-11-18 11:07:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253790319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:07:10,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:07:10,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 11:07:10,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093985690] [2024-11-18 11:07:10,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:07:10,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:07:10,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:07:10,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:07:10,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:07:10,229 INFO L87 Difference]: Start difference. First operand 2486 states and 4305 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:10,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:07:10,275 INFO L93 Difference]: Finished difference Result 4820 states and 8421 transitions. [2024-11-18 11:07:10,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:07:10,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-18 11:07:10,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:07:10,287 INFO L225 Difference]: With dead ends: 4820 [2024-11-18 11:07:10,288 INFO L226 Difference]: Without dead ends: 4814 [2024-11-18 11:07:10,289 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-11-18 11:07:10,290 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 639 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 11:07:10,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1297 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 11:07:10,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states. [2024-11-18 11:07:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 4712. [2024-11-18 11:07:10,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 4610 states have (on average 1.7806941431670282) internal successors, (8209), 4709 states have internal predecessors, (8209), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:10,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 8309 transitions. [2024-11-18 11:07:10,358 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 8309 transitions. Word has length 26 [2024-11-18 11:07:10,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:07:10,359 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 8309 transitions. [2024-11-18 11:07:10,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 8309 transitions. [2024-11-18 11:07:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-18 11:07:10,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:07:10,361 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] [2024-11-18 11:07:10,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 11:07:10,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:07:10,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:07:10,362 INFO L85 PathProgramCache]: Analyzing trace with hash 408094664, now seen corresponding path program 1 times [2024-11-18 11:07:10,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:07:10,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492295728] [2024-11-18 11:07:10,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:07:10,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:07:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:07:10,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:07:10,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:07:10,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492295728] [2024-11-18 11:07:10,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492295728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:07:10,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:07:10,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:07:10,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680373562] [2024-11-18 11:07:10,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:07:10,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:07:10,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:07:10,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:07:10,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:07:10,422 INFO L87 Difference]: Start difference. First operand 4712 states and 8309 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:12,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:07:12,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:07:12,712 INFO L93 Difference]: Finished difference Result 13701 states and 24326 transitions. [2024-11-18 11:07:12,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:07:12,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-18 11:07:12,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:07:12,740 INFO L225 Difference]: With dead ends: 13701 [2024-11-18 11:07:12,740 INFO L226 Difference]: Without dead ends: 9125 [2024-11-18 11:07:12,749 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-11-18 11:07:12,750 INFO L432 NwaCegarLoop]: 685 mSDtfsCounter, 603 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-18 11:07:12,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1323 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-18 11:07:12,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9125 states. [2024-11-18 11:07:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9125 to 9024. [2024-11-18 11:07:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9024 states, 8922 states have (on average 1.7831203765971755) internal successors, (15909), 9021 states have internal predecessors, (15909), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:12,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9024 states to 9024 states and 16009 transitions. [2024-11-18 11:07:12,923 INFO L78 Accepts]: Start accepts. Automaton has 9024 states and 16009 transitions. Word has length 27 [2024-11-18 11:07:12,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:07:12,924 INFO L471 AbstractCegarLoop]: Abstraction has 9024 states and 16009 transitions. [2024-11-18 11:07:12,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:12,924 INFO L276 IsEmpty]: Start isEmpty. Operand 9024 states and 16009 transitions. [2024-11-18 11:07:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-18 11:07:12,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:07:12,925 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] [2024-11-18 11:07:12,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 11:07:12,926 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:07:12,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:07:12,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1314669293, now seen corresponding path program 1 times [2024-11-18 11:07:12,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:07:12,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456512539] [2024-11-18 11:07:12,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:07:12,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:07:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:07:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:07:12,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:07:12,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456512539] [2024-11-18 11:07:12,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456512539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:07:12,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:07:12,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:07:12,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288411977] [2024-11-18 11:07:12,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:07:12,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:07:12,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:07:12,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:07:12,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:07:12,987 INFO L87 Difference]: Start difference. First operand 9024 states and 16009 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:16,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:07:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:07:17,934 INFO L93 Difference]: Finished difference Result 26414 states and 47011 transitions. [2024-11-18 11:07:17,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:07:17,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-18 11:07:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:07:17,972 INFO L225 Difference]: With dead ends: 26414 [2024-11-18 11:07:17,972 INFO L226 Difference]: Without dead ends: 17526 [2024-11-18 11:07:17,983 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-11-18 11:07:17,984 INFO L432 NwaCegarLoop]: 723 mSDtfsCounter, 594 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-18 11:07:17,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1351 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-18 11:07:17,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17526 states. [2024-11-18 11:07:18,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17526 to 17424. [2024-11-18 11:07:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17424 states, 17322 states have (on average 1.7797598429742525) internal successors, (30829), 17421 states have internal predecessors, (30829), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17424 states to 17424 states and 30929 transitions. [2024-11-18 11:07:18,253 INFO L78 Accepts]: Start accepts. Automaton has 17424 states and 30929 transitions. Word has length 29 [2024-11-18 11:07:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:07:18,253 INFO L471 AbstractCegarLoop]: Abstraction has 17424 states and 30929 transitions. [2024-11-18 11:07:18,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:18,253 INFO L276 IsEmpty]: Start isEmpty. Operand 17424 states and 30929 transitions. [2024-11-18 11:07:18,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-18 11:07:18,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:07:18,254 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] [2024-11-18 11:07:18,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 11:07:18,255 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:07:18,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:07:18,256 INFO L85 PathProgramCache]: Analyzing trace with hash 2099359570, now seen corresponding path program 1 times [2024-11-18 11:07:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:07:18,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067341091] [2024-11-18 11:07:18,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:07:18,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:07:18,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:07:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:07:18,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:07:18,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067341091] [2024-11-18 11:07:18,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067341091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:07:18,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:07:18,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:07:18,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837497125] [2024-11-18 11:07:18,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:07:18,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:07:18,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:07:18,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:07:18,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:07:18,313 INFO L87 Difference]: Start difference. First operand 17424 states and 30929 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:18,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 11:07:18,621 INFO L93 Difference]: Finished difference Result 34712 states and 61702 transitions. [2024-11-18 11:07:18,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 11:07:18,622 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-18 11:07:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 11:07:18,678 INFO L225 Difference]: With dead ends: 34712 [2024-11-18 11:07:18,678 INFO L226 Difference]: Without dead ends: 34709 [2024-11-18 11:07:18,681 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-11-18 11:07:18,682 INFO L432 NwaCegarLoop]: 704 mSDtfsCounter, 623 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 11:07:18,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1344 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 11:07:18,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34709 states. [2024-11-18 11:07:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34709 to 34608. [2024-11-18 11:07:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34608 states, 34506 states have (on average 1.780472961224135) internal successors, (61437), 34605 states have internal predecessors, (61437), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:19,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34608 states to 34608 states and 61537 transitions. [2024-11-18 11:07:19,602 INFO L78 Accepts]: Start accepts. Automaton has 34608 states and 61537 transitions. Word has length 30 [2024-11-18 11:07:19,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 11:07:19,602 INFO L471 AbstractCegarLoop]: Abstraction has 34608 states and 61537 transitions. [2024-11-18 11:07:19,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 34608 states and 61537 transitions. [2024-11-18 11:07:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 11:07:19,605 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 11:07:19,605 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] [2024-11-18 11:07:19,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 11:07:19,605 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 11:07:19,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 11:07:19,606 INFO L85 PathProgramCache]: Analyzing trace with hash 856506849, now seen corresponding path program 1 times [2024-11-18 11:07:19,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 11:07:19,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516416357] [2024-11-18 11:07:19,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 11:07:19,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 11:07:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 11:07:19,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-18 11:07:19,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 11:07:19,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516416357] [2024-11-18 11:07:19,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516416357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 11:07:19,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 11:07:19,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 11:07:19,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826681928] [2024-11-18 11:07:19,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 11:07:19,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 11:07:19,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 11:07:19,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 11:07:19,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 11:07:19,683 INFO L87 Difference]: Start difference. First operand 34608 states and 61537 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 11:07:23,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-18 11:07:28,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []