./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 c7c6ca5d 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-?-c7c6ca5-m [2024-11-08 11:54:42,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 11:54:42,695 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 11:54:42,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 11:54:42,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 11:54:42,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 11:54:42,743 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 11:54:42,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 11:54:42,744 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 11:54:42,745 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 11:54:42,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 11:54:42,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 11:54:42,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 11:54:42,748 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 11:54:42,748 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 11:54:42,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 11:54:42,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 11:54:42,749 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 11:54:42,749 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 11:54:42,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 11:54:42,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 11:54:42,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 11:54:42,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 11:54:42,754 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 11:54:42,754 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 11:54:42,754 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 11:54:42,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 11:54:42,755 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 11:54:42,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 11:54:42,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 11:54:42,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 11:54:42,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 11:54:42,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:54:42,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 11:54:42,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 11:54:42,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 11:54:42,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 11:54:42,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 11:54:42,757 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 11:54:42,757 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 11:54:42,757 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 11:54:42,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 11:54:42,758 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-08 11:54:42,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 11:54:42,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 11:54:42,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 11:54:42,980 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 11:54:42,980 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 11:54:42,981 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-08 11:54:44,338 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 11:54:45,417 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 11:54:45,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c [2024-11-08 11:54:45,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72bb33943/e5088a7de6154dc89e878a6b7d5699f1/FLAG65b4d9f56 [2024-11-08 11:54:45,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72bb33943/e5088a7de6154dc89e878a6b7d5699f1 [2024-11-08 11:54:45,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 11:54:45,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 11:54:45,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 11:54:45,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 11:54:45,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 11:54:45,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:54:45" (1/1) ... [2024-11-08 11:54:45,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34980b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:54:45, skipping insertion in model container [2024-11-08 11:54:45,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:54:45" (1/1) ... [2024-11-08 11:54:45,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 11:54:46,258 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-08 11:54:46,287 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-08 11:54:58,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:54:58,744 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 11:54:58,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[778,791] [2024-11-08 11:54:58,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[817,830] [2024-11-08 11:54:59,843 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 11:55:00,574 INFO L204 MainTranslator]: Completed translation [2024-11-08 11:55:00,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00 WrapperNode [2024-11-08 11:55:00,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 11:55:00,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 11:55:00,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 11:55:00,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 11:55:00,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:00,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:02,580 INFO L138 Inliner]: procedures = 710, calls = 701, calls flagged for inlining = 597, calls inlined = 597, statements flattened = 108780 [2024-11-08 11:55:02,588 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 11:55:02,589 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 11:55:02,589 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 11:55:02,589 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 11:55:02,625 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:02,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:02,803 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:03,051 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-08 11:55:03,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:03,052 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:03,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:04,059 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:04,131 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:04,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:04,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 11:55:04,370 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 11:55:04,370 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 11:55:04,370 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 11:55:04,371 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (1/1) ... [2024-11-08 11:55:04,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 11:55:04,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 11:55:04,397 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-08 11:55:04,404 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-08 11:55:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 11:55:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 11:55:04,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 11:55:04,435 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2024-11-08 11:55:04,435 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2024-11-08 11:55:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2024-11-08 11:55:04,436 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2024-11-08 11:55:04,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 11:55:04,705 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 11:55:04,718 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 11:55:22,011 INFO L? ?]: Removed 1451 outVars from TransFormulas that were not future-live. [2024-11-08 11:55:22,011 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 11:55:22,063 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 11:55:22,064 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 11:55:22,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:55:22 BoogieIcfgContainer [2024-11-08 11:55:22,064 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 11:55:22,067 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 11:55:22,068 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 11:55:22,071 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 11:55:22,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:54:45" (1/3) ... [2024-11-08 11:55:22,073 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b86bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:55:22, skipping insertion in model container [2024-11-08 11:55:22,073 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:55:00" (2/3) ... [2024-11-08 11:55:22,074 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48b86bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:55:22, skipping insertion in model container [2024-11-08 11:55:22,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:55:22" (3/3) ... [2024-11-08 11:55:22,076 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13.c [2024-11-08 11:55:22,090 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 11:55:22,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-08 11:55:22,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 11:55:22,231 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;@5a0c952d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 11:55:22,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-08 11:55:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand has 3533 states, 3428 states have (on average 1.8246791131855309) internal successors, (6255), 3430 states have internal predecessors, (6255), 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-08 11:55:22,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 11:55:22,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:22,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 11:55:22,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:22,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:22,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1914797321, now seen corresponding path program 1 times [2024-11-08 11:55:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:22,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862083356] [2024-11-08 11:55:22,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:22,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:22,743 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-08 11:55:22,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:22,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862083356] [2024-11-08 11:55:22,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862083356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:22,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:22,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:55:22,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714039482] [2024-11-08 11:55:22,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:22,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:55:22,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:22,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:55:22,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:55:22,782 INFO L87 Difference]: Start difference. First operand has 3533 states, 3428 states have (on average 1.8246791131855309) internal successors, (6255), 3430 states have internal predecessors, (6255), 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.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 11:55:33,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:33,662 INFO L93 Difference]: Finished difference Result 9556 states and 17573 transitions. [2024-11-08 11:55:33,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:55:33,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13 [2024-11-08 11:55:33,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:33,692 INFO L225 Difference]: With dead ends: 9556 [2024-11-08 11:55:33,693 INFO L226 Difference]: Without dead ends: 6016 [2024-11-08 11:55:33,700 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-08 11:55:33,703 INFO L432 NwaCegarLoop]: 6282 mSDtfsCounter, 3166 mSDsluCounter, 3916 mSDsCounter, 0 mSdLazyCounter, 13262 mSolverCounterSat, 612 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3166 SdHoareTripleChecker+Valid, 10198 SdHoareTripleChecker+Invalid, 13874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 612 IncrementalHoareTripleChecker+Valid, 13262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:33,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3166 Valid, 10198 Invalid, 13874 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [612 Valid, 13262 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-11-08 11:55:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2024-11-08 11:55:33,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 5245. [2024-11-08 11:55:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5245 states, 5143 states have (on average 1.7841726618705036) internal successors, (9176), 5242 states have internal predecessors, (9176), 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-08 11:55:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5245 states to 5245 states and 9276 transitions. [2024-11-08 11:55:33,865 INFO L78 Accepts]: Start accepts. Automaton has 5245 states and 9276 transitions. Word has length 13 [2024-11-08 11:55:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:33,866 INFO L471 AbstractCegarLoop]: Abstraction has 5245 states and 9276 transitions. [2024-11-08 11:55:33,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-08 11:55:33,866 INFO L276 IsEmpty]: Start isEmpty. Operand 5245 states and 9276 transitions. [2024-11-08 11:55:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-08 11:55:33,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:33,872 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] [2024-11-08 11:55:33,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 11:55:33,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:33,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:33,873 INFO L85 PathProgramCache]: Analyzing trace with hash -873779178, now seen corresponding path program 1 times [2024-11-08 11:55:33,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:33,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893359018] [2024-11-08 11:55:33,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:33,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:34,082 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-08 11:55:34,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:34,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893359018] [2024-11-08 11:55:34,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893359018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:34,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:34,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:55:34,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490677235] [2024-11-08 11:55:34,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:34,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:55:34,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:34,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:55:34,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:55:34,084 INFO L87 Difference]: Start difference. First operand 5245 states and 9276 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 11:55:39,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:39,040 INFO L93 Difference]: Finished difference Result 11853 states and 20876 transitions. [2024-11-08 11:55:39,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:55:39,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 22 [2024-11-08 11:55:39,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:39,058 INFO L225 Difference]: With dead ends: 11853 [2024-11-08 11:55:39,059 INFO L226 Difference]: Without dead ends: 6610 [2024-11-08 11:55:39,064 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-08 11:55:39,065 INFO L432 NwaCegarLoop]: 6516 mSDtfsCounter, 1948 mSDsluCounter, 3296 mSDsCounter, 0 mSdLazyCounter, 4502 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1948 SdHoareTripleChecker+Valid, 9812 SdHoareTripleChecker+Invalid, 4757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 4502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:39,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1948 Valid, 9812 Invalid, 4757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 4502 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-08 11:55:39,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6610 states. [2024-11-08 11:55:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6610 to 6115. [2024-11-08 11:55:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6115 states, 6013 states have (on average 1.7490437385664395) internal successors, (10517), 6112 states have internal predecessors, (10517), 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-08 11:55:39,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 10617 transitions. [2024-11-08 11:55:39,175 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 10617 transitions. Word has length 22 [2024-11-08 11:55:39,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:39,176 INFO L471 AbstractCegarLoop]: Abstraction has 6115 states and 10617 transitions. [2024-11-08 11:55:39,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 11:55:39,176 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 10617 transitions. [2024-11-08 11:55:39,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 11:55:39,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:39,177 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-11-08 11:55:39,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 11:55:39,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:39,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:39,179 INFO L85 PathProgramCache]: Analyzing trace with hash -2028786272, now seen corresponding path program 1 times [2024-11-08 11:55:39,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:39,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649660929] [2024-11-08 11:55:39,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:39,290 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-08 11:55:39,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:39,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649660929] [2024-11-08 11:55:39,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649660929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:39,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:39,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:55:39,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966949816] [2024-11-08 11:55:39,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:39,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:55:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:39,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:55:39,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:55:39,294 INFO L87 Difference]: Start difference. First operand 6115 states and 10617 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 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-11-08 11:55:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:39,519 INFO L93 Difference]: Finished difference Result 17808 states and 30942 transitions. [2024-11-08 11:55:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:55:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 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-11-08 11:55:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:39,552 INFO L225 Difference]: With dead ends: 17808 [2024-11-08 11:55:39,552 INFO L226 Difference]: Without dead ends: 11695 [2024-11-08 11:55:39,565 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-08 11:55:39,566 INFO L432 NwaCegarLoop]: 6287 mSDtfsCounter, 6151 mSDsluCounter, 6031 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6151 SdHoareTripleChecker+Valid, 12318 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.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:39,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6151 Valid, 12318 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 11:55:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11695 states. [2024-11-08 11:55:39,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11695 to 11596. [2024-11-08 11:55:39,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11596 states, 11494 states have (on average 1.7502175047851052) internal successors, (20117), 11593 states have internal predecessors, (20117), 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-08 11:55:39,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 20217 transitions. [2024-11-08 11:55:39,742 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 20217 transitions. Word has length 32 [2024-11-08 11:55:39,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:39,742 INFO L471 AbstractCegarLoop]: Abstraction has 11596 states and 20217 transitions. [2024-11-08 11:55:39,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 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-11-08 11:55:39,743 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 20217 transitions. [2024-11-08 11:55:39,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 11:55:39,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:39,744 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-11-08 11:55:39,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 11:55:39,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:39,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:39,746 INFO L85 PathProgramCache]: Analyzing trace with hash 342220768, now seen corresponding path program 1 times [2024-11-08 11:55:39,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:39,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180746119] [2024-11-08 11:55:39,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:39,830 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-08 11:55:39,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:39,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180746119] [2024-11-08 11:55:39,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180746119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:55:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025922627] [2024-11-08 11:55:39,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:39,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:55:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:39,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:55:39,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:55:39,832 INFO L87 Difference]: Start difference. First operand 11596 states and 20217 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-11-08 11:55:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:40,457 INFO L93 Difference]: Finished difference Result 34103 states and 59476 transitions. [2024-11-08 11:55:40,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:55:40,458 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-11-08 11:55:40,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:40,492 INFO L225 Difference]: With dead ends: 34103 [2024-11-08 11:55:40,492 INFO L226 Difference]: Without dead ends: 22509 [2024-11-08 11:55:40,511 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-08 11:55:40,512 INFO L432 NwaCegarLoop]: 6759 mSDtfsCounter, 5698 mSDsluCounter, 5872 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5698 SdHoareTripleChecker+Valid, 12631 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:40,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5698 Valid, 12631 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 11:55:40,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22509 states. [2024-11-08 11:55:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22509 to 22396. [2024-11-08 11:55:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22396 states, 22294 states have (on average 1.7489459047277294) internal successors, (38991), 22393 states have internal predecessors, (38991), 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-08 11:55:40,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22396 states to 22396 states and 39091 transitions. [2024-11-08 11:55:40,870 INFO L78 Accepts]: Start accepts. Automaton has 22396 states and 39091 transitions. Word has length 32 [2024-11-08 11:55:40,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:40,872 INFO L471 AbstractCegarLoop]: Abstraction has 22396 states and 39091 transitions. [2024-11-08 11:55:40,872 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-11-08 11:55:40,872 INFO L276 IsEmpty]: Start isEmpty. Operand 22396 states and 39091 transitions. [2024-11-08 11:55:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-08 11:55:40,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:40,875 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-08 11:55:40,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 11:55:40,875 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:40,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:40,876 INFO L85 PathProgramCache]: Analyzing trace with hash 2018208297, now seen corresponding path program 1 times [2024-11-08 11:55:40,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:40,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241220938] [2024-11-08 11:55:40,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:40,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:40,980 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-08 11:55:40,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:40,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241220938] [2024-11-08 11:55:40,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241220938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:40,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:40,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:55:40,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722347368] [2024-11-08 11:55:40,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:40,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:55:40,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:40,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:55:40,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:55:40,982 INFO L87 Difference]: Start difference. First operand 22396 states and 39091 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-08 11:55:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:41,335 INFO L93 Difference]: Finished difference Result 66961 states and 116860 transitions. [2024-11-08 11:55:41,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:55:41,335 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-08 11:55:41,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:41,411 INFO L225 Difference]: With dead ends: 66961 [2024-11-08 11:55:41,412 INFO L226 Difference]: Without dead ends: 44567 [2024-11-08 11:55:41,445 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-08 11:55:41,446 INFO L432 NwaCegarLoop]: 6276 mSDtfsCounter, 6144 mSDsluCounter, 6212 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6144 SdHoareTripleChecker+Valid, 12488 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:41,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6144 Valid, 12488 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 11:55:41,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44567 states. [2024-11-08 11:55:41,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44567 to 44464. [2024-11-08 11:55:41,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44464 states, 44362 states have (on average 1.747937423921374) internal successors, (77542), 44461 states have internal predecessors, (77542), 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-08 11:55:41,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44464 states to 44464 states and 77642 transitions. [2024-11-08 11:55:41,999 INFO L78 Accepts]: Start accepts. Automaton has 44464 states and 77642 transitions. Word has length 33 [2024-11-08 11:55:41,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:41,999 INFO L471 AbstractCegarLoop]: Abstraction has 44464 states and 77642 transitions. [2024-11-08 11:55:42,000 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-08 11:55:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 44464 states and 77642 transitions. [2024-11-08 11:55:42,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 11:55:42,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:42,002 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-08 11:55:42,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 11:55:42,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:42,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:42,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1860746363, now seen corresponding path program 1 times [2024-11-08 11:55:42,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:42,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431095328] [2024-11-08 11:55:42,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:42,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:42,108 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-08 11:55:42,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:42,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431095328] [2024-11-08 11:55:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431095328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:42,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:42,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:55:42,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138572846] [2024-11-08 11:55:42,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:42,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:55:42,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:42,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:55:42,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:55:42,110 INFO L87 Difference]: Start difference. First operand 44464 states and 77642 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-08 11:55:46,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:46,200 INFO L93 Difference]: Finished difference Result 117524 states and 207236 transitions. [2024-11-08 11:55:46,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:55:46,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-08 11:55:46,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:46,643 INFO L225 Difference]: With dead ends: 117524 [2024-11-08 11:55:46,647 INFO L226 Difference]: Without dead ends: 73062 [2024-11-08 11:55:46,680 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-08 11:55:46,683 INFO L432 NwaCegarLoop]: 7496 mSDtfsCounter, 4604 mSDsluCounter, 4345 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 2122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4604 SdHoareTripleChecker+Valid, 11841 SdHoareTripleChecker+Invalid, 2924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2122 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:46,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4604 Valid, 11841 Invalid, 2924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2122 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-08 11:55:46,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73062 states. [2024-11-08 11:55:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73062 to 71260. [2024-11-08 11:55:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71260 states, 71158 states have (on average 1.7639337811630456) internal successors, (125518), 71257 states have internal predecessors, (125518), 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-08 11:55:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71260 states to 71260 states and 125618 transitions. [2024-11-08 11:55:47,768 INFO L78 Accepts]: Start accepts. Automaton has 71260 states and 125618 transitions. Word has length 34 [2024-11-08 11:55:47,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:47,768 INFO L471 AbstractCegarLoop]: Abstraction has 71260 states and 125618 transitions. [2024-11-08 11:55:47,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 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-08 11:55:47,769 INFO L276 IsEmpty]: Start isEmpty. Operand 71260 states and 125618 transitions. [2024-11-08 11:55:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 11:55:47,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:47,770 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-08 11:55:47,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 11:55:47,771 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:47,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:47,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1849249746, now seen corresponding path program 1 times [2024-11-08 11:55:47,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:47,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657879672] [2024-11-08 11:55:47,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:47,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:47,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:47,862 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-08 11:55:47,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:47,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657879672] [2024-11-08 11:55:47,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657879672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:47,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:47,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 11:55:47,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089780215] [2024-11-08 11:55:47,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:47,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:55:47,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:47,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:55:47,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:55:47,865 INFO L87 Difference]: Start difference. First operand 71260 states and 125618 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-08 11:55:49,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:55:49,237 INFO L93 Difference]: Finished difference Result 211126 states and 372228 transitions. [2024-11-08 11:55:49,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 11:55:49,238 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-08 11:55:49,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:55:49,435 INFO L225 Difference]: With dead ends: 211126 [2024-11-08 11:55:49,436 INFO L226 Difference]: Without dead ends: 139868 [2024-11-08 11:55:49,484 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-08 11:55:49,486 INFO L432 NwaCegarLoop]: 6345 mSDtfsCounter, 6023 mSDsluCounter, 6083 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6023 SdHoareTripleChecker+Valid, 12428 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 11:55:49,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6023 Valid, 12428 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 11:55:49,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139868 states. [2024-11-08 11:55:51,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139868 to 139762. [2024-11-08 11:55:51,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139762 states, 139660 states have (on average 1.7631390519833883) internal successors, (246240), 139759 states have internal predecessors, (246240), 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-08 11:55:51,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139762 states to 139762 states and 246340 transitions. [2024-11-08 11:55:51,816 INFO L78 Accepts]: Start accepts. Automaton has 139762 states and 246340 transitions. Word has length 35 [2024-11-08 11:55:51,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:55:51,816 INFO L471 AbstractCegarLoop]: Abstraction has 139762 states and 246340 transitions. [2024-11-08 11:55:51,816 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-08 11:55:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 139762 states and 246340 transitions. [2024-11-08 11:55:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 11:55:51,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:55:51,818 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-08 11:55:51,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 11:55:51,819 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:55:51,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:55:51,819 INFO L85 PathProgramCache]: Analyzing trace with hash 900277528, now seen corresponding path program 1 times [2024-11-08 11:55:51,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:55:51,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986127285] [2024-11-08 11:55:51,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:55:51,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:55:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:55:52,022 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-08 11:55:52,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:55:52,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986127285] [2024-11-08 11:55:52,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986127285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:55:52,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:55:52,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:55:52,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122802538] [2024-11-08 11:55:52,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:55:52,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 11:55:52,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:55:52,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 11:55:52,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 11:55:52,024 INFO L87 Difference]: Start difference. First operand 139762 states and 246340 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 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-08 11:56:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 11:56:00,411 INFO L93 Difference]: Finished difference Result 320985 states and 565547 transitions. [2024-11-08 11:56:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 11:56:00,413 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 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-08 11:56:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 11:56:00,721 INFO L225 Difference]: With dead ends: 320985 [2024-11-08 11:56:00,721 INFO L226 Difference]: Without dead ends: 181225 [2024-11-08 11:56:00,794 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-08 11:56:00,795 INFO L432 NwaCegarLoop]: 7251 mSDtfsCounter, 4585 mSDsluCounter, 3663 mSDsCounter, 0 mSdLazyCounter, 6645 mSolverCounterSat, 419 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4585 SdHoareTripleChecker+Valid, 10914 SdHoareTripleChecker+Invalid, 7064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 419 IncrementalHoareTripleChecker+Valid, 6645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2024-11-08 11:56:00,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4585 Valid, 10914 Invalid, 7064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [419 Valid, 6645 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2024-11-08 11:56:00,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181225 states. [2024-11-08 11:56:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181225 to 169162. [2024-11-08 11:56:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169162 states, 169060 states have (on average 1.747143026144564) internal successors, (295372), 169159 states have internal predecessors, (295372), 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-08 11:56:03,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169162 states to 169162 states and 295472 transitions. [2024-11-08 11:56:03,714 INFO L78 Accepts]: Start accepts. Automaton has 169162 states and 295472 transitions. Word has length 36 [2024-11-08 11:56:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 11:56:03,716 INFO L471 AbstractCegarLoop]: Abstraction has 169162 states and 295472 transitions. [2024-11-08 11:56:03,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 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-08 11:56:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 169162 states and 295472 transitions. [2024-11-08 11:56:03,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-08 11:56:03,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 11:56:03,718 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-08 11:56:03,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 11:56:03,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 11:56:03,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 11:56:03,724 INFO L85 PathProgramCache]: Analyzing trace with hash 965683763, now seen corresponding path program 1 times [2024-11-08 11:56:03,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 11:56:03,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588280102] [2024-11-08 11:56:03,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 11:56:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 11:56:03,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 11:56:03,801 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-08 11:56:03,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 11:56:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588280102] [2024-11-08 11:56:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588280102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 11:56:03,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 11:56:03,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 11:56:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211849202] [2024-11-08 11:56:03,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 11:56:03,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 11:56:03,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 11:56:03,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 11:56:03,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 11:56:03,806 INFO L87 Difference]: Start difference. First operand 169162 states and 295472 transitions. Second operand has 3 states, 3 states have (on average 12.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)