./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2018/Problem10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2018/Problem10.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:18:09,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:18:09,218 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:18:09,224 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:18:09,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:18:09,270 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:18:09,271 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:18:09,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:18:09,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:18:09,276 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:18:09,276 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:18:09,277 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:18:09,278 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:18:09,281 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:18:09,282 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:18:09,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:18:09,283 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:18:09,283 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:18:09,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:18:09,284 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:18:09,284 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:18:09,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:18:09,289 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:18:09,289 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:18:09,290 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:18:09,290 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:18:09,290 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:18:09,291 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:18:09,291 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:18:09,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:18:09,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:18:09,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:18:09,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:18:09,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:18:09,298 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:18:09,298 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:18:09,298 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:18:09,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:18:09,299 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:18:09,299 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:18:09,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:18:09,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:18:09,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aec1fafbe63132c51323898caadb7f7b777fc751b19e58e74eab1930ebd68833 [2024-10-31 22:18:09,625 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:18:09,679 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:18:09,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:18:09,691 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:18:09,691 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:18:09,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/eca-rers2018/Problem10.c Unable to find full path for "g++" [2024-10-31 22:18:12,303 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:18:12,714 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:18:12,716 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/sv-benchmarks/c/eca-rers2018/Problem10.c [2024-10-31 22:18:12,743 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/data/01b19ae2b/635f1c545e8e4ec096036bc37802d9d7/FLAGff7509ba4 [2024-10-31 22:18:12,767 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/data/01b19ae2b/635f1c545e8e4ec096036bc37802d9d7 [2024-10-31 22:18:12,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:18:12,774 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:18:12,776 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:18:12,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:18:12,787 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:18:12,788 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:18:12" (1/1) ... [2024-10-31 22:18:12,790 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fe2ebf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:12, skipping insertion in model container [2024-10-31 22:18:12,792 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:18:12" (1/1) ... [2024-10-31 22:18:12,889 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:18:13,231 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2024-10-31 22:18:13,241 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2024-10-31 22:18:13,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:18:13,848 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:18:13,859 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/sv-benchmarks/c/eca-rers2018/Problem10.c[778,791] [2024-10-31 22:18:13,859 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/sv-benchmarks/c/eca-rers2018/Problem10.c[817,830] [2024-10-31 22:18:14,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:18:14,126 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:18:14,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14 WrapperNode [2024-10-31 22:18:14,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:18:14,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:18:14,128 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:18:14,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:18:14,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,161 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,244 INFO L138 Inliner]: procedures = 274, calls = 248, calls flagged for inlining = 144, calls inlined = 144, statements flattened = 866 [2024-10-31 22:18:14,244 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:18:14,245 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:18:14,245 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:18:14,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:18:14,259 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,259 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,303 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:18:14,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,304 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,338 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,374 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:18:14,391 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:18:14,391 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:18:14,391 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:18:14,392 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (1/1) ... [2024-10-31 22:18:14,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:18:14,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:18:14,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:18:14,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a7034db0-c050-4444-a9ff-207a55c5425f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:18:14,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:18:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2024-10-31 22:18:14,475 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2024-10-31 22:18:14,475 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2024-10-31 22:18:14,475 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2024-10-31 22:18:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:18:14,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:18:14,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:18:14,583 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:18:14,585 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:18:16,097 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-10-31 22:18:16,098 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:18:16,145 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:18:16,145 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:18:16,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:18:16 BoogieIcfgContainer [2024-10-31 22:18:16,146 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:18:16,153 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:18:16,153 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:18:16,159 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:18:16,160 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:18:12" (1/3) ... [2024-10-31 22:18:16,161 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e01ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:18:16, skipping insertion in model container [2024-10-31 22:18:16,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:18:14" (2/3) ... [2024-10-31 22:18:16,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e01ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:18:16, skipping insertion in model container [2024-10-31 22:18:16,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:18:16" (3/3) ... [2024-10-31 22:18:16,164 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10.c [2024-10-31 22:18:16,189 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:18:16,189 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-31 22:18:16,315 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:18:16,322 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;@6f78776c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:18:16,323 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-31 22:18:16,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 468 states, 363 states have (on average 1.5922865013774106) internal successors, (578), 365 states have internal predecessors, (578), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-10-31 22:18:16,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-31 22:18:16,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:16,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:16,342 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:16,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:16,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1184212657, now seen corresponding path program 1 times [2024-10-31 22:18:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:16,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704200567] [2024-10-31 22:18:16,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:16,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:16,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:16,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704200567] [2024-10-31 22:18:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704200567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:16,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:16,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:16,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056855865] [2024-10-31 22:18:16,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:16,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:18:16,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:16,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:18:16,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:18:16,729 INFO L87 Difference]: Start difference. First operand has 468 states, 363 states have (on average 1.5922865013774106) internal successors, (578), 365 states have internal predecessors, (578), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:18,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:18,373 INFO L93 Difference]: Finished difference Result 1165 states and 2069 transitions. [2024-10-31 22:18:18,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:18:18,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-31 22:18:18,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:18,405 INFO L225 Difference]: With dead ends: 1165 [2024-10-31 22:18:18,405 INFO L226 Difference]: Without dead ends: 690 [2024-10-31 22:18:18,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:18:18,419 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 577 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:18,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 653 Invalid, 966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-31 22:18:18,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2024-10-31 22:18:18,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 557. [2024-10-31 22:18:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 455 states have (on average 1.589010989010989) internal successors, (723), 554 states have internal predecessors, (723), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:18,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 823 transitions. [2024-10-31 22:18:18,524 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 823 transitions. Word has length 13 [2024-10-31 22:18:18,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:18,525 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 823 transitions. [2024-10-31 22:18:18,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:18,525 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 823 transitions. [2024-10-31 22:18:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:18:18,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:18,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:18,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:18:18,527 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:18,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:18,530 INFO L85 PathProgramCache]: Analyzing trace with hash -249172658, now seen corresponding path program 1 times [2024-10-31 22:18:18,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:18,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562193942] [2024-10-31 22:18:18,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:18,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:18,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:18,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:18,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562193942] [2024-10-31 22:18:18,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562193942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:18,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:18,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:18,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292017349] [2024-10-31 22:18:18,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:18,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:18:18,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:18,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:18:18,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:18:18,656 INFO L87 Difference]: Start difference. First operand 557 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:19,872 INFO L93 Difference]: Finished difference Result 1704 states and 2582 transitions. [2024-10-31 22:18:19,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:18:19,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 21 [2024-10-31 22:18:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:19,879 INFO L225 Difference]: With dead ends: 1704 [2024-10-31 22:18:19,879 INFO L226 Difference]: Without dead ends: 1149 [2024-10-31 22:18:19,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:18:19,883 INFO L432 NwaCegarLoop]: 534 mSDtfsCounter, 859 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:19,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1116 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-31 22:18:19,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2024-10-31 22:18:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 888. [2024-10-31 22:18:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 786 states have (on average 1.5521628498727735) internal successors, (1220), 885 states have internal predecessors, (1220), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1320 transitions. [2024-10-31 22:18:19,943 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1320 transitions. Word has length 21 [2024-10-31 22:18:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:19,944 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1320 transitions. [2024-10-31 22:18:19,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:19,944 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1320 transitions. [2024-10-31 22:18:19,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:18:19,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:19,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:19,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:18:19,947 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:19,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:19,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1086962958, now seen corresponding path program 1 times [2024-10-31 22:18:19,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:19,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128870774] [2024-10-31 22:18:19,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:19,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:19,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:20,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:20,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128870774] [2024-10-31 22:18:20,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128870774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:20,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:20,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:20,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080579185] [2024-10-31 22:18:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:20,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:20,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:20,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:20,273 INFO L87 Difference]: Start difference. First operand 888 states and 1320 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:20,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:20,323 INFO L93 Difference]: Finished difference Result 1774 states and 2638 transitions. [2024-10-31 22:18:20,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:20,326 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-31 22:18:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:20,332 INFO L225 Difference]: With dead ends: 1774 [2024-10-31 22:18:20,332 INFO L226 Difference]: Without dead ends: 888 [2024-10-31 22:18:20,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:20,339 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 1 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:20,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1127 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:18:20,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2024-10-31 22:18:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 888. [2024-10-31 22:18:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 786 states have (on average 1.5508905852417303) internal successors, (1219), 885 states have internal predecessors, (1219), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:20,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1319 transitions. [2024-10-31 22:18:20,376 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1319 transitions. Word has length 24 [2024-10-31 22:18:20,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:20,377 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1319 transitions. [2024-10-31 22:18:20,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:20,377 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1319 transitions. [2024-10-31 22:18:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:18:20,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:20,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:20,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:18:20,380 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:20,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1345128396, now seen corresponding path program 1 times [2024-10-31 22:18:20,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:20,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853620669] [2024-10-31 22:18:20,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:20,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:20,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:20,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:20,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853620669] [2024-10-31 22:18:20,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853620669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:20,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:20,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:20,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024008265] [2024-10-31 22:18:20,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:20,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:20,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:20,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:20,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:20,478 INFO L87 Difference]: Start difference. First operand 888 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:20,780 INFO L93 Difference]: Finished difference Result 2201 states and 3265 transitions. [2024-10-31 22:18:20,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:20,781 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-31 22:18:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:20,789 INFO L225 Difference]: With dead ends: 2201 [2024-10-31 22:18:20,789 INFO L226 Difference]: Without dead ends: 1315 [2024-10-31 22:18:20,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:20,797 INFO L432 NwaCegarLoop]: 941 mSDtfsCounter, 533 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1382 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:20,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1382 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:18:20,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-10-31 22:18:20,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1231. [2024-10-31 22:18:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 1129 states have (on average 1.5491585473870682) internal successors, (1749), 1228 states have internal predecessors, (1749), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:20,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1849 transitions. [2024-10-31 22:18:20,848 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1849 transitions. Word has length 24 [2024-10-31 22:18:20,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:20,849 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1849 transitions. [2024-10-31 22:18:20,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1849 transitions. [2024-10-31 22:18:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:18:20,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:20,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:20,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:18:20,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:20,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:20,854 INFO L85 PathProgramCache]: Analyzing trace with hash 500156944, now seen corresponding path program 1 times [2024-10-31 22:18:20,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:20,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633775328] [2024-10-31 22:18:20,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:20,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:20,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:20,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:20,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633775328] [2024-10-31 22:18:20,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633775328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:20,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:20,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:20,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618487058] [2024-10-31 22:18:20,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:20,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:20,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:20,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:20,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:20,914 INFO L87 Difference]: Start difference. First operand 1231 states and 1849 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:21,739 INFO L93 Difference]: Finished difference Result 3169 states and 4832 transitions. [2024-10-31 22:18:21,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:21,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-31 22:18:21,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:21,749 INFO L225 Difference]: With dead ends: 3169 [2024-10-31 22:18:21,750 INFO L226 Difference]: Without dead ends: 1940 [2024-10-31 22:18:21,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:21,753 INFO L432 NwaCegarLoop]: 656 mSDtfsCounter, 310 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:21,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 801 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:18:21,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2024-10-31 22:18:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1397. [2024-10-31 22:18:21,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1397 states, 1295 states have (on average 1.4517374517374517) internal successors, (1880), 1394 states have internal predecessors, (1880), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:21,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1397 states to 1397 states and 1980 transitions. [2024-10-31 22:18:21,804 INFO L78 Accepts]: Start accepts. Automaton has 1397 states and 1980 transitions. Word has length 24 [2024-10-31 22:18:21,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:21,804 INFO L471 AbstractCegarLoop]: Abstraction has 1397 states and 1980 transitions. [2024-10-31 22:18:21,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:21,804 INFO L276 IsEmpty]: Start isEmpty. Operand 1397 states and 1980 transitions. [2024-10-31 22:18:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:18:21,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:21,808 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:21,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:18:21,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:21,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:21,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1201221522, now seen corresponding path program 1 times [2024-10-31 22:18:21,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:21,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120203504] [2024-10-31 22:18:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:21,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120203504] [2024-10-31 22:18:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120203504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:21,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:21,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:18:21,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690662864] [2024-10-31 22:18:21,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:21,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:21,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:21,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:21,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:21,862 INFO L87 Difference]: Start difference. First operand 1397 states and 1980 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:22,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:22,046 INFO L93 Difference]: Finished difference Result 4140 states and 5880 transitions. [2024-10-31 22:18:22,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:22,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-31 22:18:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:22,057 INFO L225 Difference]: With dead ends: 4140 [2024-10-31 22:18:22,057 INFO L226 Difference]: Without dead ends: 2745 [2024-10-31 22:18:22,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:22,061 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 510 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:22,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 1073 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:22,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2024-10-31 22:18:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 2657. [2024-10-31 22:18:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2555 states have (on average 1.4348336594911937) internal successors, (3666), 2654 states have internal predecessors, (3666), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 3766 transitions. [2024-10-31 22:18:22,141 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 3766 transitions. Word has length 24 [2024-10-31 22:18:22,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:22,141 INFO L471 AbstractCegarLoop]: Abstraction has 2657 states and 3766 transitions. [2024-10-31 22:18:22,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:22,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 3766 transitions. [2024-10-31 22:18:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:18:22,143 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:22,143 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:22,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:18:22,144 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:22,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:22,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1417555436, now seen corresponding path program 1 times [2024-10-31 22:18:22,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:22,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875006350] [2024-10-31 22:18:22,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:22,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:22,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:22,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:22,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875006350] [2024-10-31 22:18:22,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875006350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:22,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:22,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:22,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145663562] [2024-10-31 22:18:22,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:22,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:22,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:22,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:22,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:22,193 INFO L87 Difference]: Start difference. First operand 2657 states and 3766 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:23,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:23,095 INFO L93 Difference]: Finished difference Result 6143 states and 8908 transitions. [2024-10-31 22:18:23,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:23,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-31 22:18:23,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:23,108 INFO L225 Difference]: With dead ends: 6143 [2024-10-31 22:18:23,108 INFO L226 Difference]: Without dead ends: 3488 [2024-10-31 22:18:23,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:23,114 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 230 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:23,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 722 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:18:23,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3488 states. [2024-10-31 22:18:23,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3488 to 3484. [2024-10-31 22:18:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3484 states, 3382 states have (on average 1.3746303962152573) internal successors, (4649), 3481 states have internal predecessors, (4649), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:23,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3484 states to 3484 states and 4749 transitions. [2024-10-31 22:18:23,229 INFO L78 Accepts]: Start accepts. Automaton has 3484 states and 4749 transitions. Word has length 25 [2024-10-31 22:18:23,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:23,229 INFO L471 AbstractCegarLoop]: Abstraction has 3484 states and 4749 transitions. [2024-10-31 22:18:23,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:23,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3484 states and 4749 transitions. [2024-10-31 22:18:23,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-31 22:18:23,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:23,230 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:23,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:18:23,231 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:23,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:23,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2032440408, now seen corresponding path program 1 times [2024-10-31 22:18:23,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:23,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431682942] [2024-10-31 22:18:23,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:23,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:23,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:23,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:23,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:23,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431682942] [2024-10-31 22:18:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431682942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:23,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:23,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276609839] [2024-10-31 22:18:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:23,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:23,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:23,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:23,291 INFO L87 Difference]: Start difference. First operand 3484 states and 4749 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:24,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:24,219 INFO L93 Difference]: Finished difference Result 7813 states and 10890 transitions. [2024-10-31 22:18:24,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:24,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-31 22:18:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:24,237 INFO L225 Difference]: With dead ends: 7813 [2024-10-31 22:18:24,237 INFO L226 Difference]: Without dead ends: 4331 [2024-10-31 22:18:24,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:24,243 INFO L432 NwaCegarLoop]: 518 mSDtfsCounter, 299 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:24,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 682 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:18:24,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4331 states. [2024-10-31 22:18:24,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4331 to 4327. [2024-10-31 22:18:24,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4327 states, 4225 states have (on average 1.353846153846154) internal successors, (5720), 4324 states have internal predecessors, (5720), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4327 states to 4327 states and 5820 transitions. [2024-10-31 22:18:24,391 INFO L78 Accepts]: Start accepts. Automaton has 4327 states and 5820 transitions. Word has length 25 [2024-10-31 22:18:24,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:24,391 INFO L471 AbstractCegarLoop]: Abstraction has 4327 states and 5820 transitions. [2024-10-31 22:18:24,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 4327 states and 5820 transitions. [2024-10-31 22:18:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:18:24,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:24,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:24,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:18:24,393 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:24,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:24,394 INFO L85 PathProgramCache]: Analyzing trace with hash -995255721, now seen corresponding path program 1 times [2024-10-31 22:18:24,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:24,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786728800] [2024-10-31 22:18:24,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:24,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:24,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:24,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:24,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786728800] [2024-10-31 22:18:24,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786728800] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:24,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:24,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:24,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638951384] [2024-10-31 22:18:24,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:24,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:24,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:24,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:24,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:24,465 INFO L87 Difference]: Start difference. First operand 4327 states and 5820 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:24,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:24,605 INFO L93 Difference]: Finished difference Result 8549 states and 11509 transitions. [2024-10-31 22:18:24,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:24,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-31 22:18:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:24,641 INFO L225 Difference]: With dead ends: 8549 [2024-10-31 22:18:24,641 INFO L226 Difference]: Without dead ends: 8542 [2024-10-31 22:18:24,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:24,647 INFO L432 NwaCegarLoop]: 1005 mSDtfsCounter, 548 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 1555 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:24,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 1555 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:18:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8542 states. [2024-10-31 22:18:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8542 to 8441. [2024-10-31 22:18:24,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8441 states, 8339 states have (on average 1.3492025422712555) internal successors, (11251), 8438 states have internal predecessors, (11251), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:24,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8441 states to 8441 states and 11351 transitions. [2024-10-31 22:18:24,917 INFO L78 Accepts]: Start accepts. Automaton has 8441 states and 11351 transitions. Word has length 26 [2024-10-31 22:18:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:24,917 INFO L471 AbstractCegarLoop]: Abstraction has 8441 states and 11351 transitions. [2024-10-31 22:18:24,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 8441 states and 11351 transitions. [2024-10-31 22:18:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-31 22:18:24,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:24,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:24,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:18:24,919 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:24,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1419566957, now seen corresponding path program 1 times [2024-10-31 22:18:24,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:24,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403250205] [2024-10-31 22:18:24,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:24,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:24,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:24,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:24,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403250205] [2024-10-31 22:18:24,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403250205] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:24,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:24,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:18:24,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644747186] [2024-10-31 22:18:24,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:24,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:24,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:24,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:24,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:24,980 INFO L87 Difference]: Start difference. First operand 8441 states and 11351 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:25,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:25,142 INFO L93 Difference]: Finished difference Result 16979 states and 22797 transitions. [2024-10-31 22:18:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:25,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-31 22:18:25,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:25,169 INFO L225 Difference]: With dead ends: 16979 [2024-10-31 22:18:25,169 INFO L226 Difference]: Without dead ends: 8540 [2024-10-31 22:18:25,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:25,181 INFO L432 NwaCegarLoop]: 663 mSDtfsCounter, 533 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:25,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1209 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:18:25,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8540 states. [2024-10-31 22:18:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8540 to 8439. [2024-10-31 22:18:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8439 states, 8339 states have (on average 1.3441659671423432) internal successors, (11209), 8436 states have internal predecessors, (11209), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8439 states to 8439 states and 11307 transitions. [2024-10-31 22:18:25,441 INFO L78 Accepts]: Start accepts. Automaton has 8439 states and 11307 transitions. Word has length 26 [2024-10-31 22:18:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:25,442 INFO L471 AbstractCegarLoop]: Abstraction has 8439 states and 11307 transitions. [2024-10-31 22:18:25,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 8439 states and 11307 transitions. [2024-10-31 22:18:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-31 22:18:25,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:25,443 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:25,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:18:25,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:25,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:25,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1314457887, now seen corresponding path program 1 times [2024-10-31 22:18:25,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:25,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268844482] [2024-10-31 22:18:25,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:25,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:25,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:25,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268844482] [2024-10-31 22:18:25,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268844482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:25,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:25,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:18:25,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683942083] [2024-10-31 22:18:25,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:25,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:25,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:25,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:25,491 INFO L87 Difference]: Start difference. First operand 8439 states and 11307 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:25,687 INFO L93 Difference]: Finished difference Result 25142 states and 33722 transitions. [2024-10-31 22:18:25,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:25,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 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 28 [2024-10-31 22:18:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:25,727 INFO L225 Difference]: With dead ends: 25142 [2024-10-31 22:18:25,727 INFO L226 Difference]: Without dead ends: 16705 [2024-10-31 22:18:25,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:25,743 INFO L432 NwaCegarLoop]: 562 mSDtfsCounter, 526 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:25,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1108 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:18:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2024-10-31 22:18:26,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 16607. [2024-10-31 22:18:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16607 states, 16507 states have (on average 1.3390076937057007) internal successors, (22103), 16604 states have internal predecessors, (22103), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16607 states to 16607 states and 22201 transitions. [2024-10-31 22:18:26,306 INFO L78 Accepts]: Start accepts. Automaton has 16607 states and 22201 transitions. Word has length 28 [2024-10-31 22:18:26,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:26,306 INFO L471 AbstractCegarLoop]: Abstraction has 16607 states and 22201 transitions. [2024-10-31 22:18:26,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 16607 states and 22201 transitions. [2024-10-31 22:18:26,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-31 22:18:26,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:26,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:26,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:18:26,308 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:26,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:26,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1594983404, now seen corresponding path program 1 times [2024-10-31 22:18:26,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:26,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383383496] [2024-10-31 22:18:26,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:26,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:26,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383383496] [2024-10-31 22:18:26,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383383496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:26,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:26,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:26,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086721258] [2024-10-31 22:18:26,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:26,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:26,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:26,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:26,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:26,371 INFO L87 Difference]: Start difference. First operand 16607 states and 22201 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:26,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:26,963 INFO L93 Difference]: Finished difference Result 48238 states and 64732 transitions. [2024-10-31 22:18:26,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:26,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-31 22:18:26,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:27,035 INFO L225 Difference]: With dead ends: 48238 [2024-10-31 22:18:27,035 INFO L226 Difference]: Without dead ends: 31633 [2024-10-31 22:18:27,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:27,053 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 504 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:27,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1352 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:18:27,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31633 states. [2024-10-31 22:18:27,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31633 to 31544. [2024-10-31 22:18:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31544 states, 31444 states have (on average 1.3317644065640504) internal successors, (41876), 31541 states have internal predecessors, (41876), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:27,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31544 states to 31544 states and 41974 transitions. [2024-10-31 22:18:27,871 INFO L78 Accepts]: Start accepts. Automaton has 31544 states and 41974 transitions. Word has length 33 [2024-10-31 22:18:27,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:27,871 INFO L471 AbstractCegarLoop]: Abstraction has 31544 states and 41974 transitions. [2024-10-31 22:18:27,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:27,872 INFO L276 IsEmpty]: Start isEmpty. Operand 31544 states and 41974 transitions. [2024-10-31 22:18:27,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-31 22:18:27,873 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:27,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:27,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:18:27,873 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:27,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:27,874 INFO L85 PathProgramCache]: Analyzing trace with hash 132362279, now seen corresponding path program 1 times [2024-10-31 22:18:27,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:27,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060780859] [2024-10-31 22:18:27,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:27,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:27,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:27,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060780859] [2024-10-31 22:18:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060780859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:27,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:27,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501027999] [2024-10-31 22:18:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:27,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:27,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:27,941 INFO L87 Difference]: Start difference. First operand 31544 states and 41974 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:29,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:29,333 INFO L93 Difference]: Finished difference Result 73175 states and 97409 transitions. [2024-10-31 22:18:29,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:29,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-31 22:18:29,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:29,429 INFO L225 Difference]: With dead ends: 73175 [2024-10-31 22:18:29,429 INFO L226 Difference]: Without dead ends: 41633 [2024-10-31 22:18:29,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:29,454 INFO L432 NwaCegarLoop]: 519 mSDtfsCounter, 483 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:29,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 965 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:18:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41633 states. [2024-10-31 22:18:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41633 to 41551. [2024-10-31 22:18:30,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41551 states, 41451 states have (on average 1.3153603049383609) internal successors, (54523), 41548 states have internal predecessors, (54523), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:30,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41551 states to 41551 states and 54621 transitions. [2024-10-31 22:18:30,360 INFO L78 Accepts]: Start accepts. Automaton has 41551 states and 54621 transitions. Word has length 34 [2024-10-31 22:18:30,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:30,362 INFO L471 AbstractCegarLoop]: Abstraction has 41551 states and 54621 transitions. [2024-10-31 22:18:30,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 41551 states and 54621 transitions. [2024-10-31 22:18:30,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-31 22:18:30,363 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:30,364 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:30,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:18:30,364 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:30,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash -209128006, now seen corresponding path program 1 times [2024-10-31 22:18:30,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:30,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106462549] [2024-10-31 22:18:30,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:30,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:30,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:30,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106462549] [2024-10-31 22:18:30,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106462549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:30,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:30,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:18:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471773056] [2024-10-31 22:18:30,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:30,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:30,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:30,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:30,445 INFO L87 Difference]: Start difference. First operand 41551 states and 54621 transitions. Second operand has 3 states, 3 states have (on average 13.0) 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) [2024-10-31 22:18:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:31,528 INFO L93 Difference]: Finished difference Result 105458 states and 138388 transitions. [2024-10-31 22:18:31,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:31,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) 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) Word has length 40 [2024-10-31 22:18:31,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:31,664 INFO L225 Difference]: With dead ends: 105458 [2024-10-31 22:18:31,664 INFO L226 Difference]: Without dead ends: 63909 [2024-10-31 22:18:31,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:31,699 INFO L432 NwaCegarLoop]: 980 mSDtfsCounter, 440 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:31,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 1445 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:18:31,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63909 states. [2024-10-31 22:18:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63909 to 59950. [2024-10-31 22:18:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59950 states, 59850 states have (on average 1.2822222222222222) internal successors, (76741), 59947 states have internal predecessors, (76741), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:33,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59950 states to 59950 states and 76839 transitions. [2024-10-31 22:18:33,157 INFO L78 Accepts]: Start accepts. Automaton has 59950 states and 76839 transitions. Word has length 40 [2024-10-31 22:18:33,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:33,158 INFO L471 AbstractCegarLoop]: Abstraction has 59950 states and 76839 transitions. [2024-10-31 22:18:33,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) 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) [2024-10-31 22:18:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 59950 states and 76839 transitions. [2024-10-31 22:18:33,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-10-31 22:18:33,159 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:33,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:33,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:18:33,160 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:33,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:33,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1653138166, now seen corresponding path program 1 times [2024-10-31 22:18:33,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:33,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060658077] [2024-10-31 22:18:33,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:18:33,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:18:33,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:18:33,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060658077] [2024-10-31 22:18:33,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060658077] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:18:33,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:18:33,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:18:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895916874] [2024-10-31 22:18:33,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:18:33,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:18:33,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:18:33,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:18:33,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:33,248 INFO L87 Difference]: Start difference. First operand 59950 states and 76839 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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) [2024-10-31 22:18:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:18:34,569 INFO L93 Difference]: Finished difference Result 157117 states and 202813 transitions. [2024-10-31 22:18:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:18:34,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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) Word has length 40 [2024-10-31 22:18:34,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:18:34,858 INFO L225 Difference]: With dead ends: 157117 [2024-10-31 22:18:34,858 INFO L226 Difference]: Without dead ends: 97169 [2024-10-31 22:18:35,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:18:35,163 INFO L432 NwaCegarLoop]: 530 mSDtfsCounter, 450 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:18:35,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 984 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:18:35,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97169 states. [2024-10-31 22:18:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97169 to 97090. [2024-10-31 22:18:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97090 states, 96990 states have (on average 1.274615939787607) internal successors, (123625), 97087 states have internal predecessors, (123625), 98 states have call successors, (98), 2 states have call predecessors, (98), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:18:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97090 states to 97090 states and 123723 transitions. [2024-10-31 22:18:37,784 INFO L78 Accepts]: Start accepts. Automaton has 97090 states and 123723 transitions. Word has length 40 [2024-10-31 22:18:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:18:37,784 INFO L471 AbstractCegarLoop]: Abstraction has 97090 states and 123723 transitions. [2024-10-31 22:18:37,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 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) [2024-10-31 22:18:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 97090 states and 123723 transitions. [2024-10-31 22:18:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-31 22:18:37,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:18:37,785 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:18:37,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:18:37,786 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:18:37,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:18:37,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1240470838, now seen corresponding path program 1 times [2024-10-31 22:18:37,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:18:37,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5762750] [2024-10-31 22:18:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:18:37,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:18:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat