./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.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 aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-12 16:43:35,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 16:43:35,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-12 16:43:35,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 16:43:35,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 16:43:35,319 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 16:43:35,320 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 16:43:35,320 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 16:43:35,321 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 16:43:35,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 16:43:35,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-12 16:43:35,322 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-12 16:43:35,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 16:43:35,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 16:43:35,324 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 16:43:35,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 16:43:35,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-12 16:43:35,325 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-12 16:43:35,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 16:43:35,326 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-12 16:43:35,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 16:43:35,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-12 16:43:35,328 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-12 16:43:35,328 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-12 16:43:35,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 16:43:35,328 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-12 16:43:35,328 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 16:43:35,328 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 16:43:35,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 16:43:35,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 16:43:35,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-12 16:43:35,330 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-12 16:43:35,330 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:43:35,331 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 16:43:35,331 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-12 16:43:35,331 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-12 16:43:35,331 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 16:43:35,331 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-12 16:43:35,332 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-12 16:43:35,332 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-12 16:43:35,332 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-12 16:43:35,332 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-12 16:43:35,333 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 -> aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 [2024-10-12 16:43:35,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 16:43:35,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 16:43:35,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 16:43:35,578 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 16:43:35,578 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 16:43:35,579 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c [2024-10-12 16:43:36,808 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 16:43:37,095 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 16:43:37,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c [2024-10-12 16:43:37,114 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0d077457/64ebd33cd00041b3b705033a8fc56001/FLAG65f4c65cf [2024-10-12 16:43:37,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0d077457/64ebd33cd00041b3b705033a8fc56001 [2024-10-12 16:43:37,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 16:43:37,131 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 16:43:37,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 16:43:37,133 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 16:43:37,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 16:43:37,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298ad599 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37, skipping insertion in model container [2024-10-12 16:43:37,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 16:43:37,326 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2024-10-12 16:43:37,330 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2024-10-12 16:43:37,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:43:37,644 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 16:43:37,653 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2024-10-12 16:43:37,654 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2024-10-12 16:43:37,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 16:43:37,759 INFO L204 MainTranslator]: Completed translation [2024-10-12 16:43:37,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37 WrapperNode [2024-10-12 16:43:37,759 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 16:43:37,760 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 16:43:37,760 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 16:43:37,760 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 16:43:37,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,831 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 866 [2024-10-12 16:43:37,831 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 16:43:37,831 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 16:43:37,831 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 16:43:37,832 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 16:43:37,844 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,878 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-12 16:43:37,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,900 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,924 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 16:43:37,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 16:43:37,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 16:43:37,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 16:43:37,959 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (1/1) ... [2024-10-12 16:43:37,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-12 16:43:38,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 16:43:38,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-12 16:43:38,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-12 16:43:38,062 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-12 16:43:38,063 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2024-10-12 16:43:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2024-10-12 16:43:38,063 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2024-10-12 16:43:38,063 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2024-10-12 16:43:38,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-12 16:43:38,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 16:43:38,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 16:43:38,141 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 16:43:38,143 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 16:43:39,022 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-10-12 16:43:39,023 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 16:43:39,060 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 16:43:39,060 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-12 16:43:39,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:43:39 BoogieIcfgContainer [2024-10-12 16:43:39,061 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 16:43:39,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-12 16:43:39,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-12 16:43:39,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-12 16:43:39,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.10 04:43:37" (1/3) ... [2024-10-12 16:43:39,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26847eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:43:39, skipping insertion in model container [2024-10-12 16:43:39,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 04:43:37" (2/3) ... [2024-10-12 16:43:39,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26847eed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 04:43:39, skipping insertion in model container [2024-10-12 16:43:39,070 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 04:43:39" (3/3) ... [2024-10-12 16:43:39,071 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10.c [2024-10-12 16:43:39,085 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-12 16:43:39,086 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-12 16:43:39,159 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-12 16:43:39,164 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;@79aaa6ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-12 16:43:39,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-12 16:43:39,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 463 states, 358 states have (on average 1.600558659217877) internal successors, (573), 360 states have internal predecessors, (573), 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-10-12 16:43:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-12 16:43:39,177 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:39,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:43:39,178 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:39,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:39,184 INFO L85 PathProgramCache]: Analyzing trace with hash -973882549, now seen corresponding path program 1 times [2024-10-12 16:43:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:39,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104133743] [2024-10-12 16:43:39,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:39,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:39,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104133743] [2024-10-12 16:43:39,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104133743] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:39,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:39,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:39,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068036492] [2024-10-12 16:43:39,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:39,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:43:39,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:39,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:43:39,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:43:39,448 INFO L87 Difference]: Start difference. First operand has 463 states, 358 states have (on average 1.600558659217877) internal successors, (573), 360 states have internal predecessors, (573), 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 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-10-12 16:43:40,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:40,461 INFO L93 Difference]: Finished difference Result 1154 states and 2058 transitions. [2024-10-12 16:43:40,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:43:40,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-10-12 16:43:40,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:40,476 INFO L225 Difference]: With dead ends: 1154 [2024-10-12 16:43:40,476 INFO L226 Difference]: Without dead ends: 686 [2024-10-12 16:43:40,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:43:40,487 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 570 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:40,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 639 Invalid, 973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-12 16:43:40,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2024-10-12 16:43:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 554. [2024-10-12 16:43:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 452 states have (on average 1.592920353982301) internal successors, (720), 551 states have internal predecessors, (720), 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-10-12 16:43:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 820 transitions. [2024-10-12 16:43:40,566 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 820 transitions. Word has length 12 [2024-10-12 16:43:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:40,567 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 820 transitions. [2024-10-12 16:43:40,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-10-12 16:43:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 820 transitions. [2024-10-12 16:43:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-12 16:43:40,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:40,568 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] [2024-10-12 16:43:40,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-12 16:43:40,569 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:40,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1176212298, now seen corresponding path program 1 times [2024-10-12 16:43:40,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:40,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511260551] [2024-10-12 16:43:40,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:40,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:40,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:40,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511260551] [2024-10-12 16:43:40,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511260551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:40,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:40,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287585273] [2024-10-12 16:43:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:40,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:43:40,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:40,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:43:40,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:43:40,696 INFO L87 Difference]: Start difference. First operand 554 states and 820 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-10-12 16:43:41,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:41,382 INFO L93 Difference]: Finished difference Result 1696 states and 2574 transitions. [2024-10-12 16:43:41,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:43:41,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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 20 [2024-10-12 16:43:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:41,391 INFO L225 Difference]: With dead ends: 1696 [2024-10-12 16:43:41,392 INFO L226 Difference]: Without dead ends: 1143 [2024-10-12 16:43:41,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:43:41,394 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 855 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:41,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 1108 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-12 16:43:41,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1143 states. [2024-10-12 16:43:41,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1143 to 883. [2024-10-12 16:43:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 781 states have (on average 1.555697823303457) internal successors, (1215), 880 states have internal predecessors, (1215), 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-10-12 16:43:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1315 transitions. [2024-10-12 16:43:41,433 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1315 transitions. Word has length 20 [2024-10-12 16:43:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:41,433 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1315 transitions. [2024-10-12 16:43:41,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-10-12 16:43:41,434 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1315 transitions. [2024-10-12 16:43:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 16:43:41,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:41,436 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] [2024-10-12 16:43:41,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-12 16:43:41,436 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:41,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:41,438 INFO L85 PathProgramCache]: Analyzing trace with hash 388531602, now seen corresponding path program 1 times [2024-10-12 16:43:41,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:41,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613631415] [2024-10-12 16:43:41,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:41,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:41,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:41,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:41,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:41,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613631415] [2024-10-12 16:43:41,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613631415] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:41,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:41,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:41,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563365005] [2024-10-12 16:43:41,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:41,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:41,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:41,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:41,573 INFO L87 Difference]: Start difference. First operand 883 states and 1315 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 16:43:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:41,603 INFO L93 Difference]: Finished difference Result 1765 states and 2629 transitions. [2024-10-12 16:43:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:41,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2024-10-12 16:43:41,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:41,609 INFO L225 Difference]: With dead ends: 1765 [2024-10-12 16:43:41,609 INFO L226 Difference]: Without dead ends: 883 [2024-10-12 16:43:41,611 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-10-12 16:43:41,613 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 1 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:41,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1119 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:43:41,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2024-10-12 16:43:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2024-10-12 16:43:41,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 781 states have (on average 1.5544174135723432) internal successors, (1214), 880 states have internal predecessors, (1214), 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-10-12 16:43:41,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1314 transitions. [2024-10-12 16:43:41,654 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1314 transitions. Word has length 23 [2024-10-12 16:43:41,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:41,654 INFO L471 AbstractCegarLoop]: Abstraction has 883 states and 1314 transitions. [2024-10-12 16:43:41,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 16:43:41,654 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1314 transitions. [2024-10-12 16:43:41,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 16:43:41,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:41,658 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] [2024-10-12 16:43:41,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-12 16:43:41,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:41,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:41,659 INFO L85 PathProgramCache]: Analyzing trace with hash 646697040, now seen corresponding path program 1 times [2024-10-12 16:43:41,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:41,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515926672] [2024-10-12 16:43:41,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:41,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:41,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:41,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515926672] [2024-10-12 16:43:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515926672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:41,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:41,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:41,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357572051] [2024-10-12 16:43:41,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:41,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:41,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:41,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:41,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:41,711 INFO L87 Difference]: Start difference. First operand 883 states and 1314 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 16:43:41,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:41,866 INFO L93 Difference]: Finished difference Result 2190 states and 3254 transitions. [2024-10-12 16:43:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:41,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2024-10-12 16:43:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:41,871 INFO L225 Difference]: With dead ends: 2190 [2024-10-12 16:43:41,871 INFO L226 Difference]: Without dead ends: 1308 [2024-10-12 16:43:41,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:41,874 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 532 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:41,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1373 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 16:43:41,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-10-12 16:43:41,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1224. [2024-10-12 16:43:41,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1122 states have (on average 1.552584670231729) internal successors, (1742), 1221 states have internal predecessors, (1742), 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-10-12 16:43:41,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1842 transitions. [2024-10-12 16:43:41,903 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1842 transitions. Word has length 23 [2024-10-12 16:43:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:41,903 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1842 transitions. [2024-10-12 16:43:41,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 16:43:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1842 transitions. [2024-10-12 16:43:41,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 16:43:41,904 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:41,904 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] [2024-10-12 16:43:41,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-12 16:43:41,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:41,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:41,906 INFO L85 PathProgramCache]: Analyzing trace with hash -198274412, now seen corresponding path program 1 times [2024-10-12 16:43:41,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:41,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177544405] [2024-10-12 16:43:41,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:41,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:41,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:41,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:41,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177544405] [2024-10-12 16:43:41,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177544405] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:41,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:41,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:41,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83592493] [2024-10-12 16:43:41,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:41,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:41,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:41,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:41,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:41,982 INFO L87 Difference]: Start difference. First operand 1224 states and 1842 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 16:43:42,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:42,422 INFO L93 Difference]: Finished difference Result 3151 states and 4814 transitions. [2024-10-12 16:43:42,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:42,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 23 [2024-10-12 16:43:42,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:42,429 INFO L225 Difference]: With dead ends: 3151 [2024-10-12 16:43:42,429 INFO L226 Difference]: Without dead ends: 1928 [2024-10-12 16:43:42,431 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-10-12 16:43:42,432 INFO L432 NwaCegarLoop]: 650 mSDtfsCounter, 309 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:42,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 792 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 16:43:42,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2024-10-12 16:43:42,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1390. [2024-10-12 16:43:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1288 states have (on average 1.454192546583851) internal successors, (1873), 1387 states have internal predecessors, (1873), 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-10-12 16:43:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1973 transitions. [2024-10-12 16:43:42,462 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1973 transitions. Word has length 23 [2024-10-12 16:43:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:42,462 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1973 transitions. [2024-10-12 16:43:42,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-10-12 16:43:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1973 transitions. [2024-10-12 16:43:42,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-12 16:43:42,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:42,463 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] [2024-10-12 16:43:42,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-12 16:43:42,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:42,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:42,464 INFO L85 PathProgramCache]: Analyzing trace with hash 502790166, now seen corresponding path program 1 times [2024-10-12 16:43:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:42,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561143875] [2024-10-12 16:43:42,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:42,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:42,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:42,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561143875] [2024-10-12 16:43:42,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561143875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:42,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:42,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:43:42,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944684105] [2024-10-12 16:43:42,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:42,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:42,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:42,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:42,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:42,518 INFO L87 Difference]: Start difference. First operand 1390 states and 1973 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-10-12 16:43:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:42,633 INFO L93 Difference]: Finished difference Result 4121 states and 5861 transitions. [2024-10-12 16:43:42,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:42,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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 23 [2024-10-12 16:43:42,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:42,642 INFO L225 Difference]: With dead ends: 4121 [2024-10-12 16:43:42,643 INFO L226 Difference]: Without dead ends: 2732 [2024-10-12 16:43:42,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:42,646 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 509 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:42,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 1067 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 16:43:42,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2732 states. [2024-10-12 16:43:42,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2732 to 2644. [2024-10-12 16:43:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2644 states, 2542 states have (on average 1.43705743509048) internal successors, (3653), 2641 states have internal predecessors, (3653), 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-10-12 16:43:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 3753 transitions. [2024-10-12 16:43:42,695 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 3753 transitions. Word has length 23 [2024-10-12 16:43:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:42,696 INFO L471 AbstractCegarLoop]: Abstraction has 2644 states and 3753 transitions. [2024-10-12 16:43:42,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-10-12 16:43:42,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 3753 transitions. [2024-10-12 16:43:42,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 16:43:42,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:42,696 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-10-12 16:43:42,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-12 16:43:42,697 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:42,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1594090992, now seen corresponding path program 1 times [2024-10-12 16:43:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:42,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454277641] [2024-10-12 16:43:42,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:42,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:42,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:42,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454277641] [2024-10-12 16:43:42,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454277641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:42,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:42,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348757062] [2024-10-12 16:43:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:42,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:42,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:42,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:42,732 INFO L87 Difference]: Start difference. First operand 2644 states and 3753 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-10-12 16:43:43,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:43,228 INFO L93 Difference]: Finished difference Result 6112 states and 8877 transitions. [2024-10-12 16:43:43,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:43,229 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-10-12 16:43:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:43,241 INFO L225 Difference]: With dead ends: 6112 [2024-10-12 16:43:43,241 INFO L226 Difference]: Without dead ends: 3469 [2024-10-12 16:43:43,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:43,248 INFO L432 NwaCegarLoop]: 532 mSDtfsCounter, 229 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:43,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 713 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 16:43:43,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2024-10-12 16:43:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3465. [2024-10-12 16:43:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3465 states, 3363 states have (on average 1.376746952126078) internal successors, (4630), 3462 states have internal predecessors, (4630), 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-10-12 16:43:43,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3465 states to 3465 states and 4730 transitions. [2024-10-12 16:43:43,328 INFO L78 Accepts]: Start accepts. Automaton has 3465 states and 4730 transitions. Word has length 24 [2024-10-12 16:43:43,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:43,329 INFO L471 AbstractCegarLoop]: Abstraction has 3465 states and 4730 transitions. [2024-10-12 16:43:43,329 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-10-12 16:43:43,329 INFO L276 IsEmpty]: Start isEmpty. Operand 3465 states and 4730 transitions. [2024-10-12 16:43:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-12 16:43:43,330 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:43,330 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-10-12 16:43:43,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-12 16:43:43,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:43,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:43,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1855904852, now seen corresponding path program 1 times [2024-10-12 16:43:43,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:43,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57312302] [2024-10-12 16:43:43,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:43,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:43,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:43,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57312302] [2024-10-12 16:43:43,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57312302] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:43,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:43,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167327826] [2024-10-12 16:43:43,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:43,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:43,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:43,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:43,359 INFO L87 Difference]: Start difference. First operand 3465 states and 4730 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-10-12 16:43:43,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:43,846 INFO L93 Difference]: Finished difference Result 7770 states and 10847 transitions. [2024-10-12 16:43:43,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:43,846 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-10-12 16:43:43,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:43,859 INFO L225 Difference]: With dead ends: 7770 [2024-10-12 16:43:43,859 INFO L226 Difference]: Without dead ends: 4306 [2024-10-12 16:43:43,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:43,866 INFO L432 NwaCegarLoop]: 512 mSDtfsCounter, 298 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 467 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:43,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 673 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 467 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 16:43:43,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4306 states. [2024-10-12 16:43:43,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4306 to 4302. [2024-10-12 16:43:43,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4302 states, 4200 states have (on average 1.355952380952381) internal successors, (5695), 4299 states have internal predecessors, (5695), 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-10-12 16:43:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4302 states to 4302 states and 5795 transitions. [2024-10-12 16:43:43,935 INFO L78 Accepts]: Start accepts. Automaton has 4302 states and 5795 transitions. Word has length 24 [2024-10-12 16:43:43,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:43,935 INFO L471 AbstractCegarLoop]: Abstraction has 4302 states and 5795 transitions. [2024-10-12 16:43:43,935 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-10-12 16:43:43,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4302 states and 5795 transitions. [2024-10-12 16:43:43,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 16:43:43,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:43,936 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-10-12 16:43:43,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-12 16:43:43,937 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:43,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:43,938 INFO L85 PathProgramCache]: Analyzing trace with hash 2122076635, now seen corresponding path program 1 times [2024-10-12 16:43:43,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:43,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64878137] [2024-10-12 16:43:43,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:43,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:43,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64878137] [2024-10-12 16:43:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64878137] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:43,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:43,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80296860] [2024-10-12 16:43:43,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:43,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:43,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:43,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:43,973 INFO L87 Difference]: Start difference. First operand 4302 states and 5795 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-10-12 16:43:44,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:44,079 INFO L93 Difference]: Finished difference Result 8500 states and 11460 transitions. [2024-10-12 16:43:44,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:44,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-10-12 16:43:44,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:44,107 INFO L225 Difference]: With dead ends: 8500 [2024-10-12 16:43:44,107 INFO L226 Difference]: Without dead ends: 8493 [2024-10-12 16:43:44,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:44,115 INFO L432 NwaCegarLoop]: 999 mSDtfsCounter, 547 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1546 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:44,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1546 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:43:44,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8493 states. [2024-10-12 16:43:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8493 to 8392. [2024-10-12 16:43:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8392 states, 8290 states have (on average 1.351266586248492) internal successors, (11202), 8389 states have internal predecessors, (11202), 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-10-12 16:43:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8392 states to 8392 states and 11302 transitions. [2024-10-12 16:43:44,274 INFO L78 Accepts]: Start accepts. Automaton has 8392 states and 11302 transitions. Word has length 25 [2024-10-12 16:43:44,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:44,275 INFO L471 AbstractCegarLoop]: Abstraction has 8392 states and 11302 transitions. [2024-10-12 16:43:44,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-10-12 16:43:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8392 states and 11302 transitions. [2024-10-12 16:43:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-12 16:43:44,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:44,276 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-10-12 16:43:44,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-12 16:43:44,276 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:44,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:44,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1697765399, now seen corresponding path program 1 times [2024-10-12 16:43:44,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:44,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042767422] [2024-10-12 16:43:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:44,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:44,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:44,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042767422] [2024-10-12 16:43:44,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042767422] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:44,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:44,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:43:44,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193626117] [2024-10-12 16:43:44,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:44,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:44,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:44,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:44,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:44,320 INFO L87 Difference]: Start difference. First operand 8392 states and 11302 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-10-12 16:43:44,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:44,406 INFO L93 Difference]: Finished difference Result 16882 states and 22700 transitions. [2024-10-12 16:43:44,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:44,406 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-10-12 16:43:44,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:44,423 INFO L225 Difference]: With dead ends: 16882 [2024-10-12 16:43:44,423 INFO L226 Difference]: Without dead ends: 8491 [2024-10-12 16:43:44,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:44,434 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 532 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:44,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1203 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:43:44,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8491 states. [2024-10-12 16:43:44,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8491 to 8390. [2024-10-12 16:43:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8390 states, 8290 states have (on average 1.3462002412545235) internal successors, (11160), 8387 states have internal predecessors, (11160), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:43:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8390 states to 8390 states and 11258 transitions. [2024-10-12 16:43:44,597 INFO L78 Accepts]: Start accepts. Automaton has 8390 states and 11258 transitions. Word has length 25 [2024-10-12 16:43:44,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:44,597 INFO L471 AbstractCegarLoop]: Abstraction has 8390 states and 11258 transitions. [2024-10-12 16:43:44,598 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-10-12 16:43:44,598 INFO L276 IsEmpty]: Start isEmpty. Operand 8390 states and 11258 transitions. [2024-10-12 16:43:44,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-12 16:43:44,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:44,598 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-10-12 16:43:44,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-12 16:43:44,598 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:44,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash -816320605, now seen corresponding path program 1 times [2024-10-12 16:43:44,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:44,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136518029] [2024-10-12 16:43:44,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:44,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:44,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:44,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:44,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136518029] [2024-10-12 16:43:44,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136518029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:44,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:44,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:43:44,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376861523] [2024-10-12 16:43:44,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:44,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:44,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:44,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:44,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:44,644 INFO L87 Difference]: Start difference. First operand 8390 states and 11258 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-10-12 16:43:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:44,755 INFO L93 Difference]: Finished difference Result 24997 states and 33577 transitions. [2024-10-12 16:43:44,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:44,756 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-10-12 16:43:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:44,787 INFO L225 Difference]: With dead ends: 24997 [2024-10-12 16:43:44,787 INFO L226 Difference]: Without dead ends: 16608 [2024-10-12 16:43:44,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:44,802 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 525 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:44,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1102 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:43:44,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16608 states. [2024-10-12 16:43:45,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16608 to 16510. [2024-10-12 16:43:45,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16510 states, 16410 states have (on average 1.3410115783059111) internal successors, (22006), 16507 states have internal predecessors, (22006), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:43:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16510 states to 16510 states and 22104 transitions. [2024-10-12 16:43:45,090 INFO L78 Accepts]: Start accepts. Automaton has 16510 states and 22104 transitions. Word has length 27 [2024-10-12 16:43:45,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:45,090 INFO L471 AbstractCegarLoop]: Abstraction has 16510 states and 22104 transitions. [2024-10-12 16:43:45,091 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-10-12 16:43:45,091 INFO L276 IsEmpty]: Start isEmpty. Operand 16510 states and 22104 transitions. [2024-10-12 16:43:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-12 16:43:45,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:45,091 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:43:45,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-12 16:43:45,092 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:45,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:45,092 INFO L85 PathProgramCache]: Analyzing trace with hash 682758120, now seen corresponding path program 1 times [2024-10-12 16:43:45,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:45,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032242090] [2024-10-12 16:43:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:45,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:45,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:45,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032242090] [2024-10-12 16:43:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032242090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:45,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:45,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631179669] [2024-10-12 16:43:45,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:45,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:45,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:45,130 INFO L87 Difference]: Start difference. First operand 16510 states and 22104 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-10-12 16:43:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:45,476 INFO L93 Difference]: Finished difference Result 47949 states and 64443 transitions. [2024-10-12 16:43:45,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:45,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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 32 [2024-10-12 16:43:45,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:45,529 INFO L225 Difference]: With dead ends: 47949 [2024-10-12 16:43:45,530 INFO L226 Difference]: Without dead ends: 31440 [2024-10-12 16:43:45,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:45,544 INFO L432 NwaCegarLoop]: 852 mSDtfsCounter, 503 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:45,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1343 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 16:43:45,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31440 states. [2024-10-12 16:43:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31440 to 31351. [2024-10-12 16:43:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31351 states, 31251 states have (on average 1.3338133179738247) internal successors, (41683), 31348 states have internal predecessors, (41683), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:43:45,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31351 states to 31351 states and 41781 transitions. [2024-10-12 16:43:45,999 INFO L78 Accepts]: Start accepts. Automaton has 31351 states and 41781 transitions. Word has length 32 [2024-10-12 16:43:45,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:45,999 INFO L471 AbstractCegarLoop]: Abstraction has 31351 states and 41781 transitions. [2024-10-12 16:43:45,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 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-10-12 16:43:45,999 INFO L276 IsEmpty]: Start isEmpty. Operand 31351 states and 41781 transitions. [2024-10-12 16:43:46,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-12 16:43:46,000 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:46,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:43:46,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-12 16:43:46,000 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:46,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:46,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1918149547, now seen corresponding path program 1 times [2024-10-12 16:43:46,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:46,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757053650] [2024-10-12 16:43:46,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:46,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:46,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757053650] [2024-10-12 16:43:46,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757053650] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:46,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:46,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:46,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788110592] [2024-10-12 16:43:46,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:46,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:46,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:46,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:46,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:46,035 INFO L87 Difference]: Start difference. First operand 31351 states and 41781 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-12 16:43:46,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:46,433 INFO L93 Difference]: Finished difference Result 72726 states and 96960 transitions. [2024-10-12 16:43:46,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:46,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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 33 [2024-10-12 16:43:46,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:46,595 INFO L225 Difference]: With dead ends: 72726 [2024-10-12 16:43:46,595 INFO L226 Difference]: Without dead ends: 41376 [2024-10-12 16:43:46,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:46,615 INFO L432 NwaCegarLoop]: 515 mSDtfsCounter, 481 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 959 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:46,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 959 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 16:43:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41376 states. [2024-10-12 16:43:47,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41376 to 41294. [2024-10-12 16:43:47,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41294 states, 41194 states have (on average 1.3173277661795406) internal successors, (54266), 41291 states have internal predecessors, (54266), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:43:47,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41294 states to 41294 states and 54364 transitions. [2024-10-12 16:43:47,530 INFO L78 Accepts]: Start accepts. Automaton has 41294 states and 54364 transitions. Word has length 33 [2024-10-12 16:43:47,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:47,538 INFO L471 AbstractCegarLoop]: Abstraction has 41294 states and 54364 transitions. [2024-10-12 16:43:47,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 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-10-12 16:43:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 41294 states and 54364 transitions. [2024-10-12 16:43:47,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 16:43:47,539 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:47,539 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:43:47,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-12 16:43:47,539 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:47,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1695664578, now seen corresponding path program 1 times [2024-10-12 16:43:47,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:47,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423752753] [2024-10-12 16:43:47,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:47,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:47,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423752753] [2024-10-12 16:43:47,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423752753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:47,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:47,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:47,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99072863] [2024-10-12 16:43:47,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:47,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:47,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:47,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:47,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:47,608 INFO L87 Difference]: Start difference. First operand 41294 states and 54364 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-12 16:43:48,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:48,003 INFO L93 Difference]: Finished difference Result 104785 states and 137715 transitions. [2024-10-12 16:43:48,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:48,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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 39 [2024-10-12 16:43:48,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:48,103 INFO L225 Difference]: With dead ends: 104785 [2024-10-12 16:43:48,103 INFO L226 Difference]: Without dead ends: 63492 [2024-10-12 16:43:48,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:48,147 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 439 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:48,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 1436 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-12 16:43:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63492 states. [2024-10-12 16:43:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63492 to 59564. [2024-10-12 16:43:48,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59564 states, 59464 states have (on average 1.2840542176779228) internal successors, (76355), 59561 states have internal predecessors, (76355), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:43:48,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59564 states to 59564 states and 76453 transitions. [2024-10-12 16:43:48,996 INFO L78 Accepts]: Start accepts. Automaton has 59564 states and 76453 transitions. Word has length 39 [2024-10-12 16:43:48,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:48,998 INFO L471 AbstractCegarLoop]: Abstraction has 59564 states and 76453 transitions. [2024-10-12 16:43:48,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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-10-12 16:43:48,998 INFO L276 IsEmpty]: Start isEmpty. Operand 59564 states and 76453 transitions. [2024-10-12 16:43:48,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-12 16:43:48,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:48,999 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:43:48,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-12 16:43:48,999 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:49,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:49,000 INFO L85 PathProgramCache]: Analyzing trace with hash 166601594, now seen corresponding path program 1 times [2024-10-12 16:43:49,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:49,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827217729] [2024-10-12 16:43:49,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:49,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:49,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:49,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:49,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827217729] [2024-10-12 16:43:49,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827217729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:49,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:49,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-12 16:43:49,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899458102] [2024-10-12 16:43:49,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:49,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:49,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:49,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:49,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:49,069 INFO L87 Difference]: Start difference. First operand 59564 states and 76453 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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-10-12 16:43:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:49,875 INFO L93 Difference]: Finished difference Result 156090 states and 201786 transitions. [2024-10-12 16:43:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:49,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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 39 [2024-10-12 16:43:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:50,106 INFO L225 Difference]: With dead ends: 156090 [2024-10-12 16:43:50,107 INFO L226 Difference]: Without dead ends: 96527 [2024-10-12 16:43:50,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:50,161 INFO L432 NwaCegarLoop]: 526 mSDtfsCounter, 449 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:50,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 978 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 16:43:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96527 states. [2024-10-12 16:43:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96527 to 96448. [2024-10-12 16:43:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96448 states, 96348 states have (on average 1.276445800639349) internal successors, (122983), 96445 states have internal predecessors, (122983), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:43:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96448 states to 96448 states and 123081 transitions. [2024-10-12 16:43:51,593 INFO L78 Accepts]: Start accepts. Automaton has 96448 states and 123081 transitions. Word has length 39 [2024-10-12 16:43:51,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:51,593 INFO L471 AbstractCegarLoop]: Abstraction has 96448 states and 123081 transitions. [2024-10-12 16:43:51,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 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-10-12 16:43:51,594 INFO L276 IsEmpty]: Start isEmpty. Operand 96448 states and 123081 transitions. [2024-10-12 16:43:51,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-10-12 16:43:51,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:51,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:43:51,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-12 16:43:51,594 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:51,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:51,595 INFO L85 PathProgramCache]: Analyzing trace with hash -47031098, now seen corresponding path program 1 times [2024-10-12 16:43:51,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:51,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777208322] [2024-10-12 16:43:51,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:51,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:51,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:51,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:51,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777208322] [2024-10-12 16:43:51,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777208322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:51,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:51,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:51,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244403155] [2024-10-12 16:43:51,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:51,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:43:51,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:51,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:43:51,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:51,651 INFO L87 Difference]: Start difference. First operand 96448 states and 123081 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-10-12 16:43:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:52,312 INFO L93 Difference]: Finished difference Result 172891 states and 219988 transitions. [2024-10-12 16:43:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:43:52,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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 44 [2024-10-12 16:43:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:52,741 INFO L225 Difference]: With dead ends: 172891 [2024-10-12 16:43:52,741 INFO L226 Difference]: Without dead ends: 172888 [2024-10-12 16:43:52,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:43:52,766 INFO L432 NwaCegarLoop]: 1030 mSDtfsCounter, 526 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:52,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1567 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:43:52,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172888 states. [2024-10-12 16:43:54,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172888 to 172668. [2024-10-12 16:43:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172668 states, 172568 states have (on average 1.2715393352185804) internal successors, (219427), 172665 states have internal predecessors, (219427), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:43:55,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172668 states to 172668 states and 219525 transitions. [2024-10-12 16:43:55,085 INFO L78 Accepts]: Start accepts. Automaton has 172668 states and 219525 transitions. Word has length 44 [2024-10-12 16:43:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:43:55,086 INFO L471 AbstractCegarLoop]: Abstraction has 172668 states and 219525 transitions. [2024-10-12 16:43:55,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 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-10-12 16:43:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 172668 states and 219525 transitions. [2024-10-12 16:43:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-12 16:43:55,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:43:55,087 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:43:55,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-12 16:43:55,087 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:43:55,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:43:55,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2000323693, now seen corresponding path program 1 times [2024-10-12 16:43:55,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:43:55,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88441253] [2024-10-12 16:43:55,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:43:55,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:43:55,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:43:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:43:55,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:43:55,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88441253] [2024-10-12 16:43:55,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88441253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:43:55,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:43:55,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:43:55,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057031254] [2024-10-12 16:43:55,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:43:55,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:43:55,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:43:55,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:43:55,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:43:55,159 INFO L87 Difference]: Start difference. First operand 172668 states and 219525 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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-10-12 16:43:57,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:43:57,167 INFO L93 Difference]: Finished difference Result 451351 states and 573250 transitions. [2024-10-12 16:43:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 16:43:57,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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 47 [2024-10-12 16:43:57,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:43:57,706 INFO L225 Difference]: With dead ends: 451351 [2024-10-12 16:43:57,707 INFO L226 Difference]: Without dead ends: 278684 [2024-10-12 16:43:57,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:43:57,788 INFO L432 NwaCegarLoop]: 578 mSDtfsCounter, 862 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 862 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:43:57,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [862 Valid, 717 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 16:43:57,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278684 states. [2024-10-12 16:44:00,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278684 to 172663. [2024-10-12 16:44:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172663 states, 172568 states have (on average 1.2614563534374854) internal successors, (217687), 172660 states have internal predecessors, (217687), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:00,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172663 states to 172663 states and 217780 transitions. [2024-10-12 16:44:00,360 INFO L78 Accepts]: Start accepts. Automaton has 172663 states and 217780 transitions. Word has length 47 [2024-10-12 16:44:00,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:44:00,361 INFO L471 AbstractCegarLoop]: Abstraction has 172663 states and 217780 transitions. [2024-10-12 16:44:00,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 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-10-12 16:44:00,361 INFO L276 IsEmpty]: Start isEmpty. Operand 172663 states and 217780 transitions. [2024-10-12 16:44:00,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-12 16:44:00,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:44:00,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:44:00,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-12 16:44:00,361 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:44:00,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:44:00,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1428399207, now seen corresponding path program 1 times [2024-10-12 16:44:00,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:44:00,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174362809] [2024-10-12 16:44:00,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:44:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:44:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:44:00,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:44:00,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:44:00,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174362809] [2024-10-12 16:44:00,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174362809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:44:00,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:44:00,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:44:00,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368298940] [2024-10-12 16:44:00,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:44:00,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:44:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:44:00,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:44:00,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:00,399 INFO L87 Difference]: Start difference. First operand 172663 states and 217780 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-10-12 16:44:01,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:44:01,862 INFO L93 Difference]: Finished difference Result 341099 states and 430506 transitions. [2024-10-12 16:44:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:44:01,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 57 [2024-10-12 16:44:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:44:02,508 INFO L225 Difference]: With dead ends: 341099 [2024-10-12 16:44:02,508 INFO L226 Difference]: Without dead ends: 168437 [2024-10-12 16:44:02,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:02,598 INFO L432 NwaCegarLoop]: 280 mSDtfsCounter, 387 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 452 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-12 16:44:02,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 355 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 452 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-12 16:44:02,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168437 states. [2024-10-12 16:44:04,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168437 to 89205. [2024-10-12 16:44:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89205 states, 89110 states have (on average 1.2030972954774997) internal successors, (107208), 89202 states have internal predecessors, (107208), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:04,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89205 states to 89205 states and 107301 transitions. [2024-10-12 16:44:04,240 INFO L78 Accepts]: Start accepts. Automaton has 89205 states and 107301 transitions. Word has length 57 [2024-10-12 16:44:04,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:44:04,240 INFO L471 AbstractCegarLoop]: Abstraction has 89205 states and 107301 transitions. [2024-10-12 16:44:04,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-10-12 16:44:04,240 INFO L276 IsEmpty]: Start isEmpty. Operand 89205 states and 107301 transitions. [2024-10-12 16:44:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-12 16:44:04,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:44:04,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:44:04,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-12 16:44:04,241 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:44:04,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:44:04,242 INFO L85 PathProgramCache]: Analyzing trace with hash -883141712, now seen corresponding path program 1 times [2024-10-12 16:44:04,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:44:04,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523588138] [2024-10-12 16:44:04,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:44:04,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:44:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:44:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:44:04,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:44:04,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523588138] [2024-10-12 16:44:04,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523588138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:44:04,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:44:04,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:44:04,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887466107] [2024-10-12 16:44:04,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:44:04,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:44:04,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:44:04,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:44:04,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:04,312 INFO L87 Difference]: Start difference. First operand 89205 states and 107301 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-10-12 16:44:04,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:44:04,709 INFO L93 Difference]: Finished difference Result 127428 states and 152501 transitions. [2024-10-12 16:44:04,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:44:04,710 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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 112 [2024-10-12 16:44:04,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:44:05,302 INFO L225 Difference]: With dead ends: 127428 [2024-10-12 16:44:05,302 INFO L226 Difference]: Without dead ends: 127423 [2024-10-12 16:44:05,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:05,312 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 444 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 1255 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-12 16:44:05,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 1255 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-12 16:44:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127423 states. [2024-10-12 16:44:06,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127423 to 127210. [2024-10-12 16:44:06,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127210 states, 127115 states have (on average 1.1919757699720726) internal successors, (151518), 127207 states have internal predecessors, (151518), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:06,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127210 states to 127210 states and 151611 transitions. [2024-10-12 16:44:06,730 INFO L78 Accepts]: Start accepts. Automaton has 127210 states and 151611 transitions. Word has length 112 [2024-10-12 16:44:06,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:44:06,730 INFO L471 AbstractCegarLoop]: Abstraction has 127210 states and 151611 transitions. [2024-10-12 16:44:06,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 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-10-12 16:44:06,730 INFO L276 IsEmpty]: Start isEmpty. Operand 127210 states and 151611 transitions. [2024-10-12 16:44:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-12 16:44:06,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:44:06,732 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:44:06,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-12 16:44:06,732 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:44:06,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:44:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1720004066, now seen corresponding path program 1 times [2024-10-12 16:44:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:44:06,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419640412] [2024-10-12 16:44:06,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:44:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:44:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:44:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-12 16:44:06,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:44:06,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419640412] [2024-10-12 16:44:06,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419640412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:44:06,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:44:06,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:44:06,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532734357] [2024-10-12 16:44:06,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:44:06,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:44:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:44:06,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:44:06,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:06,796 INFO L87 Difference]: Start difference. First operand 127210 states and 151611 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-10-12 16:44:08,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:44:08,260 INFO L93 Difference]: Finished difference Result 273603 states and 330310 transitions. [2024-10-12 16:44:08,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:44:08,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 142 [2024-10-12 16:44:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:44:08,524 INFO L225 Difference]: With dead ends: 273603 [2024-10-12 16:44:08,525 INFO L226 Difference]: Without dead ends: 146514 [2024-10-12 16:44:08,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:08,623 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 321 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-12 16:44:08,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 512 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 464 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-12 16:44:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146514 states. [2024-10-12 16:44:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146514 to 146206. [2024-10-12 16:44:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146206 states, 146111 states have (on average 1.1940237216910432) internal successors, (174460), 146203 states have internal predecessors, (174460), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146206 states to 146206 states and 174553 transitions. [2024-10-12 16:44:10,858 INFO L78 Accepts]: Start accepts. Automaton has 146206 states and 174553 transitions. Word has length 142 [2024-10-12 16:44:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:44:10,859 INFO L471 AbstractCegarLoop]: Abstraction has 146206 states and 174553 transitions. [2024-10-12 16:44:10,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-10-12 16:44:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 146206 states and 174553 transitions. [2024-10-12 16:44:10,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-12 16:44:10,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:44:10,861 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:44:10,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-12 16:44:10,861 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:44:10,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:44:10,862 INFO L85 PathProgramCache]: Analyzing trace with hash 17048110, now seen corresponding path program 1 times [2024-10-12 16:44:10,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:44:10,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482738082] [2024-10-12 16:44:10,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:44:10,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:44:10,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:44:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-12 16:44:11,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:44:11,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482738082] [2024-10-12 16:44:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482738082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:44:11,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:44:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 16:44:11,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870535700] [2024-10-12 16:44:11,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:44:11,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-12 16:44:11,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:44:11,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-12 16:44:11,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-12 16:44:11,040 INFO L87 Difference]: Start difference. First operand 146206 states and 174553 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-10-12 16:44:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 16:44:12,639 INFO L93 Difference]: Finished difference Result 421121 states and 503082 transitions. [2024-10-12 16:44:12,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-12 16:44:12,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 144 [2024-10-12 16:44:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-12 16:44:13,056 INFO L225 Difference]: With dead ends: 421121 [2024-10-12 16:44:13,056 INFO L226 Difference]: Without dead ends: 275036 [2024-10-12 16:44:13,165 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-10-12 16:44:13,165 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 511 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 511 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-12 16:44:13,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [511 Valid, 910 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-12 16:44:13,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275036 states. [2024-10-12 16:44:16,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275036 to 274849. [2024-10-12 16:44:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274849 states, 274754 states have (on average 1.1923830044330566) internal successors, (327612), 274846 states have internal predecessors, (327612), 93 states have call successors, (93), 2 states have call predecessors, (93), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-12 16:44:17,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274849 states to 274849 states and 327705 transitions. [2024-10-12 16:44:17,043 INFO L78 Accepts]: Start accepts. Automaton has 274849 states and 327705 transitions. Word has length 144 [2024-10-12 16:44:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-12 16:44:17,044 INFO L471 AbstractCegarLoop]: Abstraction has 274849 states and 327705 transitions. [2024-10-12 16:44:17,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-10-12 16:44:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 274849 states and 327705 transitions. [2024-10-12 16:44:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-12 16:44:17,045 INFO L207 NwaCegarLoop]: Found error trace [2024-10-12 16:44:17,045 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 16:44:17,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-12 16:44:17,046 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-12 16:44:17,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 16:44:17,046 INFO L85 PathProgramCache]: Analyzing trace with hash 260470623, now seen corresponding path program 1 times [2024-10-12 16:44:17,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 16:44:17,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115049180] [2024-10-12 16:44:17,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 16:44:17,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 16:44:17,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 16:44:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 16:44:17,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 16:44:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115049180] [2024-10-12 16:44:17,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115049180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 16:44:17,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 16:44:17,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 16:44:17,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93475337] [2024-10-12 16:44:17,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 16:44:17,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-12 16:44:17,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 16:44:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 16:44:17,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-12 16:44:17,738 INFO L87 Difference]: Start difference. First operand 274849 states and 327705 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 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)