./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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2018/Problem13.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-551b009-m [2025-01-09 00:29:14,761 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:29:14,810 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:29:14,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:29:14,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:29:14,840 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:29:14,841 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:29:14,841 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:29:14,842 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:29:14,842 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:29:14,842 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:29:14,842 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:29:14,842 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:29:14,843 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:29:14,843 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:29:14,843 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:29:14,843 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:29:14,843 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:29:14,843 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:29:14,844 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:29:14,844 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:29:14,844 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:29:14,844 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:29:14,844 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:29:14,844 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:29:14,844 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:29:14,845 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:29:14,845 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:29:14,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:29:14,845 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:29:14,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:29:14,846 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:29:14,846 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 [2025-01-09 00:29:15,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:29:15,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:29:15,115 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:29:15,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:29:15,115 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:29:15,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2018/Problem13.c [2025-01-09 00:29:16,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caf8b3d9b/ac0ef6334a954afa815b5d57a855bf31/FLAGe5eaa9c96 [2025-01-09 00:29:17,213 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:29:17,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c [2025-01-09 00:29:17,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caf8b3d9b/ac0ef6334a954afa815b5d57a855bf31/FLAGe5eaa9c96 [2025-01-09 00:29:17,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/caf8b3d9b/ac0ef6334a954afa815b5d57a855bf31 [2025-01-09 00:29:17,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:29:17,322 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:29:17,324 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:29:17,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:29:17,327 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:29:17,327 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:29:17" (1/1) ... [2025-01-09 00:29:17,328 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59ae716a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:17, skipping insertion in model container [2025-01-09 00:29:17,328 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:29:17" (1/1) ... [2025-01-09 00:29:17,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:29:17,950 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[778,791] [2025-01-09 00:29:17,975 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[817,830] [2025-01-09 00:29:31,124 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:29:31,148 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:29:31,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[778,791] [2025-01-09 00:29:31,161 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2018/Problem13.c[817,830] [2025-01-09 00:29:32,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:29:32,832 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:29:32,833 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32 WrapperNode [2025-01-09 00:29:32,833 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:29:32,834 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:29:32,835 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:29:32,835 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:29:32,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:33,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:33,939 INFO L138 Inliner]: procedures = 710, calls = 701, calls flagged for inlining = 597, calls inlined = 597, statements flattened = 108777 [2025-01-09 00:29:33,940 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:29:33,941 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:29:33,941 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:29:33,941 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:29:33,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:33,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:34,051 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:34,293 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]. [2025-01-09 00:29:34,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:34,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:34,659 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:34,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:34,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:34,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:34,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:35,116 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:29:35,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:29:35,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:29:35,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:29:35,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (1/1) ... [2025-01-09 00:29:35,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:29:35,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:29:35,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:29:35,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:29:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:29:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:29:35,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:29:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2025-01-09 00:29:35,164 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2025-01-09 00:29:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2025-01-09 00:29:35,164 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2025-01-09 00:29:35,164 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:29:35,416 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:29:35,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:29:51,520 INFO L? ?]: Removed 1451 outVars from TransFormulas that were not future-live. [2025-01-09 00:29:51,521 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:29:51,581 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:29:51,581 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:29:51,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:29:51 BoogieIcfgContainer [2025-01-09 00:29:51,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:29:51,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:29:51,584 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:29:51,588 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:29:51,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:29:17" (1/3) ... [2025-01-09 00:29:51,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2321a7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:29:51, skipping insertion in model container [2025-01-09 00:29:51,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:29:32" (2/3) ... [2025-01-09 00:29:51,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2321a7e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:29:51, skipping insertion in model container [2025-01-09 00:29:51,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:29:51" (3/3) ... [2025-01-09 00:29:51,590 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13.c [2025-01-09 00:29:51,600 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:29:51,603 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13.c that has 3 procedures, 3533 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-01-09 00:29:51,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:29:51,720 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;@d421fcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:29:51,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 00:29:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand has 3533 states, 3428 states have (on average 1.8243873978996499) internal successors, (6254), 3430 states have internal predecessors, (6254), 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) [2025-01-09 00:29:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-01-09 00:29:51,737 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:29:51,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:29:51,737 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:29:51,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:29:51,741 INFO L85 PathProgramCache]: Analyzing trace with hash -504655342, now seen corresponding path program 1 times [2025-01-09 00:29:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:29:51,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073525157] [2025-01-09 00:29:51,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:29:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:29:51,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-09 00:29:51,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-09 00:29:51,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:29:51,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:29:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:29:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:29:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073525157] [2025-01-09 00:29:52,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073525157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:29:52,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:29:52,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:29:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250547598] [2025-01-09 00:29:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:29:52,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:29:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:29:52,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:29:52,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:29:52,289 INFO L87 Difference]: Start difference. First operand has 3533 states, 3428 states have (on average 1.8243873978996499) internal successors, (6254), 3430 states have internal predecessors, (6254), 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) [2025-01-09 00:30:02,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:02,953 INFO L93 Difference]: Finished difference Result 9556 states and 17569 transitions. [2025-01-09 00:30:02,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:30:02,955 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 [2025-01-09 00:30:02,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:02,990 INFO L225 Difference]: With dead ends: 9556 [2025-01-09 00:30:02,990 INFO L226 Difference]: Without dead ends: 6016 [2025-01-09 00:30:03,000 INFO L434 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 [2025-01-09 00:30:03,003 INFO L435 NwaCegarLoop]: 6269 mSDtfsCounter, 3159 mSDsluCounter, 3915 mSDsCounter, 0 mSdLazyCounter, 13244 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3159 SdHoareTripleChecker+Valid, 10184 SdHoareTripleChecker+Invalid, 13857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 13244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:03,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3159 Valid, 10184 Invalid, 13857 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [613 Valid, 13244 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2025-01-09 00:30:03,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6016 states. [2025-01-09 00:30:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6016 to 5245. [2025-01-09 00:30:03,157 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) [2025-01-09 00:30:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5245 states to 5245 states and 9276 transitions. [2025-01-09 00:30:03,179 INFO L78 Accepts]: Start accepts. Automaton has 5245 states and 9276 transitions. Word has length 13 [2025-01-09 00:30:03,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:03,179 INFO L471 AbstractCegarLoop]: Abstraction has 5245 states and 9276 transitions. [2025-01-09 00:30:03,179 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) [2025-01-09 00:30:03,180 INFO L276 IsEmpty]: Start isEmpty. Operand 5245 states and 9276 transitions. [2025-01-09 00:30:03,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-01-09 00:30:03,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:03,186 INFO L218 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] [2025-01-09 00:30:03,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:30:03,187 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:03,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:03,187 INFO L85 PathProgramCache]: Analyzing trace with hash -909004330, now seen corresponding path program 1 times [2025-01-09 00:30:03,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:03,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842565931] [2025-01-09 00:30:03,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:03,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:03,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 00:30:03,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 00:30:03,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:03,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842565931] [2025-01-09 00:30:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842565931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:03,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:03,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:03,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384247346] [2025-01-09 00:30:03,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:03,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:30:03,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:03,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:30:03,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:30:03,413 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) [2025-01-09 00:30:08,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:08,115 INFO L93 Difference]: Finished difference Result 11853 states and 20876 transitions. [2025-01-09 00:30:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:30:08,115 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 [2025-01-09 00:30:08,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:08,134 INFO L225 Difference]: With dead ends: 11853 [2025-01-09 00:30:08,134 INFO L226 Difference]: Without dead ends: 6610 [2025-01-09 00:30:08,140 INFO L434 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 [2025-01-09 00:30:08,140 INFO L435 NwaCegarLoop]: 6520 mSDtfsCounter, 1945 mSDsluCounter, 3296 mSDsCounter, 0 mSdLazyCounter, 4509 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1945 SdHoareTripleChecker+Valid, 9816 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 4509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:08,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1945 Valid, 9816 Invalid, 4764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 4509 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 00:30:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6610 states. [2025-01-09 00:30:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6610 to 6115. [2025-01-09 00:30:08,210 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) [2025-01-09 00:30:08,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6115 states to 6115 states and 10617 transitions. [2025-01-09 00:30:08,220 INFO L78 Accepts]: Start accepts. Automaton has 6115 states and 10617 transitions. Word has length 22 [2025-01-09 00:30:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:08,221 INFO L471 AbstractCegarLoop]: Abstraction has 6115 states and 10617 transitions. [2025-01-09 00:30:08,221 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) [2025-01-09 00:30:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6115 states and 10617 transitions. [2025-01-09 00:30:08,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 00:30:08,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:08,222 INFO L218 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] [2025-01-09 00:30:08,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:30:08,222 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:08,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:08,222 INFO L85 PathProgramCache]: Analyzing trace with hash 60230720, now seen corresponding path program 1 times [2025-01-09 00:30:08,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:08,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879237905] [2025-01-09 00:30:08,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:08,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:08,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 00:30:08,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 00:30:08,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:08,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:08,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879237905] [2025-01-09 00:30:08,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879237905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:08,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:08,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:30:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622634959] [2025-01-09 00:30:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:08,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:08,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:08,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:08,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:08,291 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) [2025-01-09 00:30:08,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:08,497 INFO L93 Difference]: Finished difference Result 17808 states and 30942 transitions. [2025-01-09 00:30:08,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:08,498 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 [2025-01-09 00:30:08,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:08,527 INFO L225 Difference]: With dead ends: 17808 [2025-01-09 00:30:08,527 INFO L226 Difference]: Without dead ends: 11695 [2025-01-09 00:30:08,536 INFO L434 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 [2025-01-09 00:30:08,537 INFO L435 NwaCegarLoop]: 6260 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, 12291 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 [2025-01-09 00:30:08,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6151 Valid, 12291 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 00:30:08,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11695 states. [2025-01-09 00:30:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11695 to 11596. [2025-01-09 00:30:08,695 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) [2025-01-09 00:30:08,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11596 states to 11596 states and 20217 transitions. [2025-01-09 00:30:08,713 INFO L78 Accepts]: Start accepts. Automaton has 11596 states and 20217 transitions. Word has length 32 [2025-01-09 00:30:08,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:08,713 INFO L471 AbstractCegarLoop]: Abstraction has 11596 states and 20217 transitions. [2025-01-09 00:30:08,714 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) [2025-01-09 00:30:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 11596 states and 20217 transitions. [2025-01-09 00:30:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 00:30:08,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:08,715 INFO L218 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] [2025-01-09 00:30:08,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:30:08,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:08,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:08,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1863729536, now seen corresponding path program 1 times [2025-01-09 00:30:08,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:08,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046729992] [2025-01-09 00:30:08,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:08,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:08,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 00:30:08,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 00:30:08,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:08,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:08,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:08,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:08,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046729992] [2025-01-09 00:30:08,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046729992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:08,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:08,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:08,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084208700] [2025-01-09 00:30:08,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:08,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:08,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:08,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:08,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:08,823 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) [2025-01-09 00:30:09,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:09,431 INFO L93 Difference]: Finished difference Result 34103 states and 59476 transitions. [2025-01-09 00:30:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:09,431 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 [2025-01-09 00:30:09,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:09,469 INFO L225 Difference]: With dead ends: 34103 [2025-01-09 00:30:09,470 INFO L226 Difference]: Without dead ends: 22509 [2025-01-09 00:30:09,489 INFO L434 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 [2025-01-09 00:30:09,490 INFO L435 NwaCegarLoop]: 6761 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, 12633 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 [2025-01-09 00:30:09,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5698 Valid, 12633 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:30:09,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22509 states. [2025-01-09 00:30:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22509 to 22396. [2025-01-09 00:30:09,729 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) [2025-01-09 00:30:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22396 states to 22396 states and 39091 transitions. [2025-01-09 00:30:09,760 INFO L78 Accepts]: Start accepts. Automaton has 22396 states and 39091 transitions. Word has length 32 [2025-01-09 00:30:09,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:09,760 INFO L471 AbstractCegarLoop]: Abstraction has 22396 states and 39091 transitions. [2025-01-09 00:30:09,760 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) [2025-01-09 00:30:09,760 INFO L276 IsEmpty]: Start isEmpty. Operand 22396 states and 39091 transitions. [2025-01-09 00:30:09,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 00:30:09,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:09,761 INFO L218 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] [2025-01-09 00:30:09,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:30:09,762 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:09,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1941741692, now seen corresponding path program 1 times [2025-01-09 00:30:09,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:09,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181568114] [2025-01-09 00:30:09,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:09,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:09,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 00:30:09,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 00:30:09,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:09,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:09,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:09,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181568114] [2025-01-09 00:30:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181568114] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:09,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:30:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866333660] [2025-01-09 00:30:09,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:09,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:09,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:09,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:09,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:09,849 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) [2025-01-09 00:30:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:10,199 INFO L93 Difference]: Finished difference Result 66961 states and 116860 transitions. [2025-01-09 00:30:10,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:10,199 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 [2025-01-09 00:30:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:10,290 INFO L225 Difference]: With dead ends: 66961 [2025-01-09 00:30:10,290 INFO L226 Difference]: Without dead ends: 44567 [2025-01-09 00:30:10,310 INFO L434 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 [2025-01-09 00:30:10,310 INFO L435 NwaCegarLoop]: 6279 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, 12491 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 [2025-01-09 00:30:10,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6144 Valid, 12491 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 00:30:10,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44567 states. [2025-01-09 00:30:10,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44567 to 44464. [2025-01-09 00:30:10,718 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) [2025-01-09 00:30:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44464 states to 44464 states and 77642 transitions. [2025-01-09 00:30:10,776 INFO L78 Accepts]: Start accepts. Automaton has 44464 states and 77642 transitions. Word has length 33 [2025-01-09 00:30:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:10,776 INFO L471 AbstractCegarLoop]: Abstraction has 44464 states and 77642 transitions. [2025-01-09 00:30:10,776 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) [2025-01-09 00:30:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 44464 states and 77642 transitions. [2025-01-09 00:30:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 00:30:10,778 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:10,778 INFO L218 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] [2025-01-09 00:30:10,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:30:10,778 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:10,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:10,778 INFO L85 PathProgramCache]: Analyzing trace with hash -65144443, now seen corresponding path program 1 times [2025-01-09 00:30:10,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:10,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753557358] [2025-01-09 00:30:10,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:10,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:10,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 00:30:10,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 00:30:10,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:10,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:10,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:10,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753557358] [2025-01-09 00:30:10,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753557358] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:10,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:10,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:10,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043369261] [2025-01-09 00:30:10,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:10,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:10,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:10,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:10,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:10,870 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) [2025-01-09 00:30:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:14,329 INFO L93 Difference]: Finished difference Result 117524 states and 207236 transitions. [2025-01-09 00:30:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:14,329 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 [2025-01-09 00:30:14,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:14,475 INFO L225 Difference]: With dead ends: 117524 [2025-01-09 00:30:14,475 INFO L226 Difference]: Without dead ends: 73062 [2025-01-09 00:30:14,522 INFO L434 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 [2025-01-09 00:30:14,522 INFO L435 NwaCegarLoop]: 7471 mSDtfsCounter, 4604 mSDsluCounter, 4345 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 2130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4604 SdHoareTripleChecker+Valid, 11816 SdHoareTripleChecker+Invalid, 2935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2130 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:14,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4604 Valid, 11816 Invalid, 2935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2130 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-01-09 00:30:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73062 states. [2025-01-09 00:30:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73062 to 71260. [2025-01-09 00:30:15,371 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) [2025-01-09 00:30:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71260 states to 71260 states and 125618 transitions. [2025-01-09 00:30:15,466 INFO L78 Accepts]: Start accepts. Automaton has 71260 states and 125618 transitions. Word has length 34 [2025-01-09 00:30:15,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:15,466 INFO L471 AbstractCegarLoop]: Abstraction has 71260 states and 125618 transitions. [2025-01-09 00:30:15,466 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) [2025-01-09 00:30:15,466 INFO L276 IsEmpty]: Start isEmpty. Operand 71260 states and 125618 transitions. [2025-01-09 00:30:15,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-09 00:30:15,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:15,467 INFO L218 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] [2025-01-09 00:30:15,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:30:15,467 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:15,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:15,468 INFO L85 PathProgramCache]: Analyzing trace with hash -2020165079, now seen corresponding path program 1 times [2025-01-09 00:30:15,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:15,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62187458] [2025-01-09 00:30:15,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:15,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:15,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 00:30:15,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 00:30:15,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:15,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:15,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:15,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62187458] [2025-01-09 00:30:15,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62187458] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:15,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:15,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:30:15,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422899908] [2025-01-09 00:30:15,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:15,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:15,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:15,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:15,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:15,553 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) [2025-01-09 00:30:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:16,569 INFO L93 Difference]: Finished difference Result 211126 states and 372228 transitions. [2025-01-09 00:30:16,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:16,569 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 [2025-01-09 00:30:16,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:16,814 INFO L225 Difference]: With dead ends: 211126 [2025-01-09 00:30:16,814 INFO L226 Difference]: Without dead ends: 139868 [2025-01-09 00:30:16,872 INFO L434 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 [2025-01-09 00:30:16,873 INFO L435 NwaCegarLoop]: 6365 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, 12448 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 [2025-01-09 00:30:16,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6023 Valid, 12448 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 00:30:16,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139868 states. [2025-01-09 00:30:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139868 to 139762. [2025-01-09 00:30:18,478 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) [2025-01-09 00:30:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139762 states to 139762 states and 246340 transitions. [2025-01-09 00:30:19,025 INFO L78 Accepts]: Start accepts. Automaton has 139762 states and 246340 transitions. Word has length 35 [2025-01-09 00:30:19,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:19,026 INFO L471 AbstractCegarLoop]: Abstraction has 139762 states and 246340 transitions. [2025-01-09 00:30:19,026 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) [2025-01-09 00:30:19,026 INFO L276 IsEmpty]: Start isEmpty. Operand 139762 states and 246340 transitions. [2025-01-09 00:30:19,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 00:30:19,027 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:19,028 INFO L218 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] [2025-01-09 00:30:19,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:30:19,028 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:19,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:19,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1176733174, now seen corresponding path program 1 times [2025-01-09 00:30:19,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:19,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675731080] [2025-01-09 00:30:19,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:19,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:19,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 00:30:19,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 00:30:19,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:19,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675731080] [2025-01-09 00:30:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675731080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:19,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:19,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990551123] [2025-01-09 00:30:19,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:19,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:30:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:19,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:30:19,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:30:19,341 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) [2025-01-09 00:30:26,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:26,751 INFO L93 Difference]: Finished difference Result 320985 states and 565547 transitions. [2025-01-09 00:30:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:30:26,752 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 [2025-01-09 00:30:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:27,010 INFO L225 Difference]: With dead ends: 320985 [2025-01-09 00:30:27,011 INFO L226 Difference]: Without dead ends: 181225 [2025-01-09 00:30:27,090 INFO L434 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 [2025-01-09 00:30:27,091 INFO L435 NwaCegarLoop]: 7283 mSDtfsCounter, 4557 mSDsluCounter, 3663 mSDsCounter, 0 mSdLazyCounter, 6662 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4557 SdHoareTripleChecker+Valid, 10946 SdHoareTripleChecker+Invalid, 7079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 6662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:27,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4557 Valid, 10946 Invalid, 7079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 6662 Invalid, 0 Unknown, 0 Unchecked, 6.5s Time] [2025-01-09 00:30:27,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181225 states. [2025-01-09 00:30:28,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181225 to 169162. [2025-01-09 00:30:28,902 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) [2025-01-09 00:30:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169162 states to 169162 states and 295472 transitions. [2025-01-09 00:30:29,467 INFO L78 Accepts]: Start accepts. Automaton has 169162 states and 295472 transitions. Word has length 36 [2025-01-09 00:30:29,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:29,468 INFO L471 AbstractCegarLoop]: Abstraction has 169162 states and 295472 transitions. [2025-01-09 00:30:29,471 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) [2025-01-09 00:30:29,471 INFO L276 IsEmpty]: Start isEmpty. Operand 169162 states and 295472 transitions. [2025-01-09 00:30:29,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 00:30:29,473 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:29,473 INFO L218 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] [2025-01-09 00:30:29,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:30:29,473 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:29,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:29,474 INFO L85 PathProgramCache]: Analyzing trace with hash -75194162, now seen corresponding path program 1 times [2025-01-09 00:30:29,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:29,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722466737] [2025-01-09 00:30:29,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:29,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:29,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 00:30:29,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 00:30:29,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:29,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:29,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:29,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722466737] [2025-01-09 00:30:29,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722466737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:29,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:29,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:29,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33643369] [2025-01-09 00:30:29,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:29,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:30:29,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:29,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:30:29,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:30:29,572 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) [2025-01-09 00:30:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:30:33,990 INFO L93 Difference]: Finished difference Result 400496 states and 702364 transitions. [2025-01-09 00:30:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:30:33,990 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 37 [2025-01-09 00:30:33,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:30:34,587 INFO L225 Difference]: With dead ends: 400496 [2025-01-09 00:30:34,587 INFO L226 Difference]: Without dead ends: 231336 [2025-01-09 00:30:34,644 INFO L434 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 [2025-01-09 00:30:34,645 INFO L435 NwaCegarLoop]: 9888 mSDtfsCounter, 4490 mSDsluCounter, 4418 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 895 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4490 SdHoareTripleChecker+Valid, 14306 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 895 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 00:30:34,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4490 Valid, 14306 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [895 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 00:30:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231336 states. [2025-01-09 00:30:36,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231336 to 222318. [2025-01-09 00:30:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222318 states, 222216 states have (on average 1.7468364114195198) internal successors, (388175), 222315 states have internal predecessors, (388175), 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) [2025-01-09 00:30:37,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222318 states to 222318 states and 388275 transitions. [2025-01-09 00:30:37,424 INFO L78 Accepts]: Start accepts. Automaton has 222318 states and 388275 transitions. Word has length 37 [2025-01-09 00:30:37,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:30:37,424 INFO L471 AbstractCegarLoop]: Abstraction has 222318 states and 388275 transitions. [2025-01-09 00:30:37,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2025-01-09 00:30:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 222318 states and 388275 transitions. [2025-01-09 00:30:37,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-01-09 00:30:37,426 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:30:37,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:30:37,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 00:30:37,426 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:30:37,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:30:37,427 INFO L85 PathProgramCache]: Analyzing trace with hash 249177140, now seen corresponding path program 1 times [2025-01-09 00:30:37,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:30:37,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701502608] [2025-01-09 00:30:37,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:30:37,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:30:37,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 00:30:37,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 00:30:37,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:30:37,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:30:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:30:37,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:30:37,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701502608] [2025-01-09 00:30:37,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701502608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:30:37,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:30:37,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:30:37,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625208038] [2025-01-09 00:30:37,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:30:37,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:30:37,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:30:37,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:30:37,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:30:37,625 INFO L87 Difference]: Start difference. First operand 222318 states and 388275 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 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)