./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2018/Problem13.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2018/Problem13.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 39257b2f2790dc593eb015569e826a332fcc3e3cd918d00daa305f748c1b3d75 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 20:08:07,321 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 20:08:07,402 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 20:08:07,410 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 20:08:07,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 20:08:07,441 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 20:08:07,441 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 20:08:07,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 20:08:07,442 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 20:08:07,444 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 20:08:07,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 20:08:07,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 20:08:07,445 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 20:08:07,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 20:08:07,447 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 20:08:07,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 20:08:07,448 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 20:08:07,448 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 20:08:07,448 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 20:08:07,449 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 20:08:07,449 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 20:08:07,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 20:08:07,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 20:08:07,454 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 20:08:07,455 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 20:08:07,455 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 20:08:07,455 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 20:08:07,455 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 20:08:07,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 20:08:07,456 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 20:08:07,456 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 20:08:07,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 20:08:07,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:08:07,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 20:08:07,458 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 20:08:07,458 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 20:08:07,458 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 20:08:07,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 20:08:07,459 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 20:08:07,460 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 20:08:07,460 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 20:08:07,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 20:08:07,461 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 -> 39257b2f2790dc593eb015569e826a332fcc3e3cd918d00daa305f748c1b3d75 [2024-11-09 20:08:07,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 20:08:07,729 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 20:08:07,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 20:08:07,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 20:08:07,734 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 20:08:07,736 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2018/Problem13.c [2024-11-09 20:08:09,108 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 20:08:10,294 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 20:08:10,296 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c [2024-11-09 20:08:10,474 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8725cd203/3db62dad97fd4dc2bc9cfa6ea2c24793/FLAG04b26b53b [2024-11-09 20:08:10,691 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8725cd203/3db62dad97fd4dc2bc9cfa6ea2c24793 [2024-11-09 20:08:10,693 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 20:08:10,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 20:08:10,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 20:08:10,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 20:08:10,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 20:08:10,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:08:10" (1/1) ... [2024-11-09 20:08:10,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e79685 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:10, skipping insertion in model container [2024-11-09 20:08:10,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 08:08:10" (1/1) ... [2024-11-09 20:08:11,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 20:08:12,190 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[778,791] [2024-11-09 20:08:12,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[817,830] [2024-11-09 20:08:25,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:08:25,906 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 20:08:25,918 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[778,791] [2024-11-09 20:08:25,919 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[817,830] [2024-11-09 20:08:27,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 20:08:28,382 INFO L204 MainTranslator]: Completed translation [2024-11-09 20:08:28,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28 WrapperNode [2024-11-09 20:08:28,383 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 20:08:28,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 20:08:28,384 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 20:08:28,384 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 20:08:28,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:28,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:30,793 INFO L138 Inliner]: procedures = 710, calls = 701, calls flagged for inlining = 597, calls inlined = 597, statements flattened = 108779 [2024-11-09 20:08:30,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 20:08:30,795 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 20:08:30,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 20:08:30,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 20:08:30,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:30,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:31,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:31,612 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 20:08:31,613 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:31,613 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:32,267 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:32,522 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:32,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:32,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:32,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 20:08:32,941 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 20:08:32,942 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 20:08:32,942 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 20:08:32,943 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (1/1) ... [2024-11-09 20:08:32,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 20:08:32,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 20:08:32,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 20:08:32,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 20:08:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 20:08:33,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 20:08:33,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 20:08:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2024-11-09 20:08:33,035 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2024-11-09 20:08:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2024-11-09 20:08:33,035 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2024-11-09 20:08:33,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 20:08:33,424 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 20:08:33,426 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 20:08:52,929 INFO L? ?]: Removed 1451 outVars from TransFormulas that were not future-live. [2024-11-09 20:08:52,930 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 20:08:53,003 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 20:08:53,004 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 20:08:53,005 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:08:53 BoogieIcfgContainer [2024-11-09 20:08:53,005 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 20:08:53,007 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 20:08:53,008 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 20:08:53,011 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 20:08:53,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 08:08:10" (1/3) ... [2024-11-09 20:08:53,012 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23509ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:08:53, skipping insertion in model container [2024-11-09 20:08:53,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 08:08:28" (2/3) ... [2024-11-09 20:08:53,013 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23509ae0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 08:08:53, skipping insertion in model container [2024-11-09 20:08:53,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 08:08:53" (3/3) ... [2024-11-09 20:08:53,015 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13.c [2024-11-09 20:08:53,031 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 20:08:53,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 20:08:53,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 20:08:53,193 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;@5e7ac09b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 20:08:53,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 20:08:53,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 3534 states, 3429 states have (on average 1.8244386118401867) internal successors, (6256), 3431 states have internal predecessors, (6256), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-09 20:08:53,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 20:08:53,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:08:53,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 20:08:53,229 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:08:53,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:08:53,236 INFO L85 PathProgramCache]: Analyzing trace with hash 147325527, now seen corresponding path program 1 times [2024-11-09 20:08:53,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:08:53,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95412966] [2024-11-09 20:08:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:08:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:08:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:08:53,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:08:53,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:08:53,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95412966] [2024-11-09 20:08:53,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95412966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:08:53,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:08:53,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:08:53,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708361086] [2024-11-09 20:08:53,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:08:53,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:08:53,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:08:53,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:08:53,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:08:53,892 INFO L87 Difference]: Start difference. First operand has 3534 states, 3429 states have (on average 1.8244386118401867) internal successors, (6256), 3431 states have internal predecessors, (6256), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:02,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:02,667 INFO L93 Difference]: Finished difference Result 9560 states and 17577 transitions. [2024-11-09 20:09:02,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:09:02,670 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2024-11-09 20:09:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:02,715 INFO L225 Difference]: With dead ends: 9560 [2024-11-09 20:09:02,715 INFO L226 Difference]: Without dead ends: 6019 [2024-11-09 20:09:02,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:09:02,731 INFO L432 NwaCegarLoop]: 6292 mSDtfsCounter, 4892 mSDsluCounter, 3323 mSDsCounter, 0 mSdLazyCounter, 7373 mSolverCounterSat, 614 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4892 SdHoareTripleChecker+Valid, 9615 SdHoareTripleChecker+Invalid, 7987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 614 IncrementalHoareTripleChecker+Valid, 7373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-09 20:09:02,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4892 Valid, 9615 Invalid, 7987 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [614 Valid, 7373 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-11-09 20:09:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6019 states. [2024-11-09 20:09:02,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6019 to 5247. [2024-11-09 20:09:02,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5247 states, 5145 states have (on average 1.7838678328474247) internal successors, (9178), 5244 states have internal predecessors, (9178), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5247 states to 5247 states and 9278 transitions. [2024-11-09 20:09:02,950 INFO L78 Accepts]: Start accepts. Automaton has 5247 states and 9278 transitions. Word has length 14 [2024-11-09 20:09:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:02,950 INFO L471 AbstractCegarLoop]: Abstraction has 5247 states and 9278 transitions. [2024-11-09 20:09:02,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5247 states and 9278 transitions. [2024-11-09 20:09:02,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 20:09:02,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:02,958 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-11-09 20:09:02,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 20:09:02,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:02,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:02,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1228882486, now seen corresponding path program 1 times [2024-11-09 20:09:02,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:02,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189766707] [2024-11-09 20:09:02,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:02,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:03,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:09:03,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:03,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189766707] [2024-11-09 20:09:03,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189766707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:09:03,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:09:03,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:09:03,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400853660] [2024-11-09 20:09:03,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:09:03,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:09:03,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:03,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:09:03,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:09:03,248 INFO L87 Difference]: Start difference. First operand 5247 states and 9278 transitions. Second operand has 4 states, 4 states have (on average 5.5) 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-11-09 20:09:11,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:11,874 INFO L93 Difference]: Finished difference Result 11861 states and 20884 transitions. [2024-11-09 20:09:11,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 20:09:11,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) 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-11-09 20:09:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:11,904 INFO L225 Difference]: With dead ends: 11861 [2024-11-09 20:09:11,905 INFO L226 Difference]: Without dead ends: 6616 [2024-11-09 20:09:11,916 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:09:11,918 INFO L432 NwaCegarLoop]: 6521 mSDtfsCounter, 1230 mSDsluCounter, 4020 mSDsCounter, 0 mSdLazyCounter, 10167 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 10541 SdHoareTripleChecker+Invalid, 10421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 10167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-11-09 20:09:11,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 10541 Invalid, 10421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 10167 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2024-11-09 20:09:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6616 states. [2024-11-09 20:09:12,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6616 to 6119. [2024-11-09 20:09:12,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6119 states, 6017 states have (on average 1.7485457869370118) internal successors, (10521), 6116 states have internal predecessors, (10521), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:12,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6119 states to 6119 states and 10621 transitions. [2024-11-09 20:09:12,100 INFO L78 Accepts]: Start accepts. Automaton has 6119 states and 10621 transitions. Word has length 23 [2024-11-09 20:09:12,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:12,100 INFO L471 AbstractCegarLoop]: Abstraction has 6119 states and 10621 transitions. [2024-11-09 20:09:12,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) 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-11-09 20:09:12,101 INFO L276 IsEmpty]: Start isEmpty. Operand 6119 states and 10621 transitions. [2024-11-09 20:09:12,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 20:09:12,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:12,104 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-11-09 20:09:12,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 20:09:12,104 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:12,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1257494736, now seen corresponding path program 1 times [2024-11-09 20:09:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:12,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126673615] [2024-11-09 20:09:12,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:12,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:09:12,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:12,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126673615] [2024-11-09 20:09:12,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126673615] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:09:12,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:09:12,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:09:12,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759375318] [2024-11-09 20:09:12,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:09:12,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:09:12,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:12,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:09:12,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:12,256 INFO L87 Difference]: Start difference. First operand 6119 states and 10621 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 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-11-09 20:09:12,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:12,611 INFO L93 Difference]: Finished difference Result 17820 states and 30954 transitions. [2024-11-09 20:09:12,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:09:12,613 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 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-11-09 20:09:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:12,657 INFO L225 Difference]: With dead ends: 17820 [2024-11-09 20:09:12,657 INFO L226 Difference]: Without dead ends: 11703 [2024-11-09 20:09:12,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:12,672 INFO L432 NwaCegarLoop]: 6288 mSDtfsCounter, 6151 mSDsluCounter, 6032 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6151 SdHoareTripleChecker+Valid, 12320 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 20:09:12,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6151 Valid, 12320 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 20:09:12,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11703 states. [2024-11-09 20:09:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11703 to 11604. [2024-11-09 20:09:12,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11604 states, 11502 states have (on average 1.7496957050947661) internal successors, (20125), 11601 states have internal predecessors, (20125), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:12,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11604 states to 11604 states and 20225 transitions. [2024-11-09 20:09:12,998 INFO L78 Accepts]: Start accepts. Automaton has 11604 states and 20225 transitions. Word has length 33 [2024-11-09 20:09:12,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:12,998 INFO L471 AbstractCegarLoop]: Abstraction has 11604 states and 20225 transitions. [2024-11-09 20:09:12,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 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-11-09 20:09:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 11604 states and 20225 transitions. [2024-11-09 20:09:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-09 20:09:13,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:13,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-11-09 20:09:13,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 20:09:13,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:13,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:13,001 INFO L85 PathProgramCache]: Analyzing trace with hash -311706384, now seen corresponding path program 1 times [2024-11-09 20:09:13,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:13,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290677159] [2024-11-09 20:09:13,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:13,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:13,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:09:13,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:13,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290677159] [2024-11-09 20:09:13,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290677159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:09:13,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:09:13,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:09:13,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948455497] [2024-11-09 20:09:13,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:09:13,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:09:13,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:13,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:09:13,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:13,158 INFO L87 Difference]: Start difference. First operand 11604 states and 20225 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-11-09 20:09:13,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:13,982 INFO L93 Difference]: Finished difference Result 34127 states and 59500 transitions. [2024-11-09 20:09:13,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:09:13,983 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-11-09 20:09:13,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:14,031 INFO L225 Difference]: With dead ends: 34127 [2024-11-09 20:09:14,031 INFO L226 Difference]: Without dead ends: 22525 [2024-11-09 20:09:14,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:14,059 INFO L432 NwaCegarLoop]: 6756 mSDtfsCounter, 5699 mSDsluCounter, 5873 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5699 SdHoareTripleChecker+Valid, 12629 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 20:09:14,062 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5699 Valid, 12629 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 20:09:14,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22525 states. [2024-11-09 20:09:14,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22525 to 22412. [2024-11-09 20:09:14,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22412 states, 22310 states have (on average 1.7484087852980725) internal successors, (39007), 22409 states have internal predecessors, (39007), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22412 states to 22412 states and 39107 transitions. [2024-11-09 20:09:14,517 INFO L78 Accepts]: Start accepts. Automaton has 22412 states and 39107 transitions. Word has length 33 [2024-11-09 20:09:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:14,518 INFO L471 AbstractCegarLoop]: Abstraction has 22412 states and 39107 transitions. [2024-11-09 20:09:14,519 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-11-09 20:09:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 22412 states and 39107 transitions. [2024-11-09 20:09:14,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 20:09:14,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:14,521 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] [2024-11-09 20:09:14,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 20:09:14,522 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:14,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:14,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1078842706, now seen corresponding path program 1 times [2024-11-09 20:09:14,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:14,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866473065] [2024-11-09 20:09:14,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:14,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:14,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:14,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-11-09 20:09:14,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:14,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866473065] [2024-11-09 20:09:14,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866473065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:09:14,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:09:14,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:09:14,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443908220] [2024-11-09 20:09:14,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:09:14,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:09:14,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:14,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:09:14,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:14,647 INFO L87 Difference]: Start difference. First operand 22412 states and 39107 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:14,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:14,974 INFO L93 Difference]: Finished difference Result 66792 states and 116491 transitions. [2024-11-09 20:09:14,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:09:14,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 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 34 [2024-11-09 20:09:14,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:15,102 INFO L225 Difference]: With dead ends: 66792 [2024-11-09 20:09:15,102 INFO L226 Difference]: Without dead ends: 44382 [2024-11-09 20:09:15,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:15,145 INFO L432 NwaCegarLoop]: 6322 mSDtfsCounter, 6132 mSDsluCounter, 6149 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6132 SdHoareTripleChecker+Valid, 12471 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:09:15,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6132 Valid, 12471 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 20:09:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44382 states. [2024-11-09 20:09:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44382 to 44280. [2024-11-09 20:09:15,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44280 states, 44178 states have (on average 1.746525419892254) internal successors, (77158), 44277 states have internal predecessors, (77158), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44280 states to 44280 states and 77258 transitions. [2024-11-09 20:09:15,761 INFO L78 Accepts]: Start accepts. Automaton has 44280 states and 77258 transitions. Word has length 34 [2024-11-09 20:09:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:15,762 INFO L471 AbstractCegarLoop]: Abstraction has 44280 states and 77258 transitions. [2024-11-09 20:09:15,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 44280 states and 77258 transitions. [2024-11-09 20:09:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 20:09:15,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:15,764 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] [2024-11-09 20:09:15,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 20:09:15,764 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:15,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:15,765 INFO L85 PathProgramCache]: Analyzing trace with hash 909733104, now seen corresponding path program 1 times [2024-11-09 20:09:15,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:15,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007164454] [2024-11-09 20:09:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:15,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:09:15,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:15,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007164454] [2024-11-09 20:09:15,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007164454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:09:15,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:09:15,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:09:15,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103295889] [2024-11-09 20:09:15,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:09:15,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:09:15,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:15,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:09:15,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:15,949 INFO L87 Difference]: Start difference. First operand 44280 states and 77258 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:17,520 INFO L93 Difference]: Finished difference Result 127361 states and 222191 transitions. [2024-11-09 20:09:17,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:09:17,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 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 35 [2024-11-09 20:09:17,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:17,703 INFO L225 Difference]: With dead ends: 127361 [2024-11-09 20:09:17,703 INFO L226 Difference]: Without dead ends: 83083 [2024-11-09 20:09:17,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:17,784 INFO L432 NwaCegarLoop]: 7717 mSDtfsCounter, 5015 mSDsluCounter, 5675 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5015 SdHoareTripleChecker+Valid, 13392 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 20:09:17,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5015 Valid, 13392 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 20:09:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83083 states. [2024-11-09 20:09:18,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83083 to 82816. [2024-11-09 20:09:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82816 states, 82714 states have (on average 1.7406484996493943) internal successors, (143976), 82813 states have internal predecessors, (143976), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:19,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82816 states to 82816 states and 144076 transitions. [2024-11-09 20:09:19,126 INFO L78 Accepts]: Start accepts. Automaton has 82816 states and 144076 transitions. Word has length 35 [2024-11-09 20:09:19,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:19,127 INFO L471 AbstractCegarLoop]: Abstraction has 82816 states and 144076 transitions. [2024-11-09 20:09:19,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand 82816 states and 144076 transitions. [2024-11-09 20:09:19,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 20:09:19,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:19,130 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] [2024-11-09 20:09:19,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 20:09:19,131 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:19,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:19,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1868928210, now seen corresponding path program 1 times [2024-11-09 20:09:19,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:19,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115909972] [2024-11-09 20:09:19,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:19,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:09:19,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:19,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115909972] [2024-11-09 20:09:19,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115909972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:09:19,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:09:19,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 20:09:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124820455] [2024-11-09 20:09:19,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:09:19,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 20:09:19,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 20:09:19,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:19,306 INFO L87 Difference]: Start difference. First operand 82816 states and 144076 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:20,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 20:09:20,396 INFO L93 Difference]: Finished difference Result 248019 states and 431431 transitions. [2024-11-09 20:09:20,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 20:09:20,397 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 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 36 [2024-11-09 20:09:20,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 20:09:20,743 INFO L225 Difference]: With dead ends: 248019 [2024-11-09 20:09:20,744 INFO L226 Difference]: Without dead ends: 165205 [2024-11-09 20:09:20,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 20:09:20,872 INFO L432 NwaCegarLoop]: 6271 mSDtfsCounter, 6139 mSDsluCounter, 6189 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6139 SdHoareTripleChecker+Valid, 12460 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 20:09:20,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6139 Valid, 12460 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 20:09:21,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165205 states. [2024-11-09 20:09:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165205 to 165102. [2024-11-09 20:09:22,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165102 states, 165000 states have (on average 1.7399515151515152) internal successors, (287092), 165099 states have internal predecessors, (287092), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165102 states to 165102 states and 287192 transitions. [2024-11-09 20:09:23,230 INFO L78 Accepts]: Start accepts. Automaton has 165102 states and 287192 transitions. Word has length 36 [2024-11-09 20:09:23,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 20:09:23,230 INFO L471 AbstractCegarLoop]: Abstraction has 165102 states and 287192 transitions. [2024-11-09 20:09:23,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 2 states have internal predecessors, (35), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 20:09:23,231 INFO L276 IsEmpty]: Start isEmpty. Operand 165102 states and 287192 transitions. [2024-11-09 20:09:23,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 20:09:23,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 20:09:23,234 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] [2024-11-09 20:09:23,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 20:09:23,234 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 20:09:23,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 20:09:23,235 INFO L85 PathProgramCache]: Analyzing trace with hash 616378785, now seen corresponding path program 1 times [2024-11-09 20:09:23,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 20:09:23,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894242127] [2024-11-09 20:09:23,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 20:09:23,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 20:09:23,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 20:09:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 20:09:23,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 20:09:23,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894242127] [2024-11-09 20:09:23,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894242127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 20:09:23,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 20:09:23,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 20:09:23,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798971913] [2024-11-09 20:09:23,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 20:09:23,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 20:09:23,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 20:09:23,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 20:09:23,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 20:09:23,490 INFO L87 Difference]: Start difference. First operand 165102 states and 287192 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 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)