./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2018/Problem11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2018/Problem11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB --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 940624650400628fbc547d76c7cce642a9063fb1576962b71733623b165f113e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:06:50,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:06:51,056 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:06:51,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:06:51,067 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:06:51,105 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:06:51,106 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:06:51,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:06:51,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:06:51,107 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:06:51,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:06:51,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:06:51,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:06:51,110 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:06:51,110 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:06:51,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:06:51,111 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:06:51,111 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:06:51,111 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:06:51,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:06:51,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:06:51,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:06:51,112 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:06:51,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:06:51,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:06:51,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:06:51,112 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:06:51,112 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:06:51,112 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:06:51,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:06:51,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:06:51,113 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:06:51,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:51,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:06:51,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:06:51,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:06:51,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:06:51,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:51,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:06:51,115 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:06:51,115 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:06:51,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:06:51,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:06:51,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:06:51,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:06:51,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:06:51,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:06:51,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:06:51,116 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 940624650400628fbc547d76c7cce642a9063fb1576962b71733623b165f113e [2024-11-28 02:06:51,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:06:51,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:06:51,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:06:51,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:06:51,435 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:06:51,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/eca-rers2018/Problem11.c [2024-11-28 02:06:54,480 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/data/7209ebe17/f0d32fa907334369b2a79f814fba4e26/FLAGfc55320d1 [2024-11-28 02:06:55,002 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:06:55,003 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/sv-benchmarks/c/eca-rers2018/Problem11.c [2024-11-28 02:06:55,041 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/data/7209ebe17/f0d32fa907334369b2a79f814fba4e26/FLAGfc55320d1 [2024-11-28 02:06:55,065 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/data/7209ebe17/f0d32fa907334369b2a79f814fba4e26 [2024-11-28 02:06:55,069 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:06:55,070 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:06:55,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:06:55,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:06:55,081 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:06:55,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,085 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d055b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:55, skipping insertion in model container [2024-11-28 02:06:55,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:06:55" (1/1) ... [2024-11-28 02:06:55,179 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:06:55,357 WARN L250 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_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/sv-benchmarks/c/eca-rers2018/Problem11.c[778,791] [2024-11-28 02:06:55,366 WARN L250 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_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/sv-benchmarks/c/eca-rers2018/Problem11.c[817,830] [2024-11-28 02:06:56,370 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:06:56,395 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:06:56,409 WARN L250 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_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/sv-benchmarks/c/eca-rers2018/Problem11.c[778,791] [2024-11-28 02:06:56,410 WARN L250 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_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/sv-benchmarks/c/eca-rers2018/Problem11.c[817,830] [2024-11-28 02:06:56,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:06:56,699 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:06:56,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56 WrapperNode [2024-11-28 02:06:56,701 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:06:56,702 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:06:56,703 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:06:56,703 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:06:56,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:56,777 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,048 INFO L138 Inliner]: procedures = 286, calls = 252, calls flagged for inlining = 148, calls inlined = 148, statements flattened = 1886 [2024-11-28 02:06:57,049 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:06:57,050 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:06:57,050 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:06:57,050 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:06:57,061 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,061 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,083 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,253 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-28 02:06:57,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,387 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,427 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,448 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,460 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:06:57,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:06:57,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:06:57,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:06:57,504 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (1/1) ... [2024-11-28 02:06:57,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:06:57,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:06:57,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:06:57,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7a4b16f1-ef3e-4f73-a4e7-85437ca8d901/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:06:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:06:57,590 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_a [2024-11-28 02:06:57,591 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_a [2024-11-28 02:06:57,591 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error_b [2024-11-28 02:06:57,591 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error_b [2024-11-28 02:06:57,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:06:57,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:06:57,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:06:57,804 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:06:57,808 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:07:38,489 INFO L? ?]: Removed 118 outVars from TransFormulas that were not future-live. [2024-11-28 02:07:38,489 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:07:38,522 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:07:38,523 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:07:38,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:38 BoogieIcfgContainer [2024-11-28 02:07:38,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:07:38,532 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:07:38,532 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:07:38,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:07:38,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:06:55" (1/3) ... [2024-11-28 02:07:38,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6cbea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:38, skipping insertion in model container [2024-11-28 02:07:38,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:06:56" (2/3) ... [2024-11-28 02:07:38,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6cbea6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:07:38, skipping insertion in model container [2024-11-28 02:07:38,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:07:38" (3/3) ... [2024-11-28 02:07:38,573 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11.c [2024-11-28 02:07:38,590 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:07:38,593 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11.c that has 3 procedures, 513 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2024-11-28 02:07:38,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:07:38,715 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;@6e205936, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:07:38,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-28 02:07:38,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 513 states, 408 states have (on average 1.6274509803921569) internal successors, (664), 410 states have internal predecessors, (664), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-28 02:07:38,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-28 02:07:38,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:07:38,737 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:07:38,738 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:07:38,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:07:38,744 INFO L85 PathProgramCache]: Analyzing trace with hash -151746730, now seen corresponding path program 1 times [2024-11-28 02:07:38,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:07:38,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145269216] [2024-11-28 02:07:38,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:07:38,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:07:38,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:07:39,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:07:39,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:07:39,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145269216] [2024-11-28 02:07:39,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145269216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:07:39,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:07:39,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:07:39,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259620827] [2024-11-28 02:07:39,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:07:39,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:07:39,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:07:39,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:07:39,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:07:39,628 INFO L87 Difference]: Start difference. First operand has 513 states, 408 states have (on average 1.6274509803921569) internal successors, (664), 410 states have internal predecessors, (664), 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.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:07:44,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:07:49,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:07:52,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:07:53,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:07:57,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:02,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:06,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:10,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:13,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:17,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:21,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:23,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:23,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:23,837 INFO L93 Difference]: Finished difference Result 1062 states and 1895 transitions. [2024-11-28 02:08:23,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:08:23,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 16 [2024-11-28 02:08:23,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:23,850 INFO L225 Difference]: With dead ends: 1062 [2024-11-28 02:08:23,851 INFO L226 Difference]: Without dead ends: 545 [2024-11-28 02:08:23,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:08:23,861 INFO L435 NwaCegarLoop]: 535 mSDtfsCounter, 144 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 105 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 852 SdHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:23,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 852 Invalid, 1260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1149 Invalid, 6 Unknown, 0 Unchecked, 44.0s Time] [2024-11-28 02:08:23,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2024-11-28 02:08:23,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 540. [2024-11-28 02:08:23,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 438 states have (on average 1.6164383561643836) internal successors, (708), 537 states have internal predecessors, (708), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 808 transitions. [2024-11-28 02:08:23,924 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 808 transitions. Word has length 16 [2024-11-28 02:08:23,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:23,925 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 808 transitions. [2024-11-28 02:08:23,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:23,925 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 808 transitions. [2024-11-28 02:08:23,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 02:08:23,926 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:23,927 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:23,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:08:23,927 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:08:23,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1326248385, now seen corresponding path program 1 times [2024-11-28 02:08:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:23,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979534934] [2024-11-28 02:08:23,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:24,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:24,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979534934] [2024-11-28 02:08:24,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979534934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:24,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:24,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:08:24,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606580801] [2024-11-28 02:08:24,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:24,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:24,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:24,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:24,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:24,532 INFO L87 Difference]: Start difference. First operand 540 states and 808 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-11-28 02:08:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:24,674 INFO L93 Difference]: Finished difference Result 945 states and 1463 transitions. [2024-11-28 02:08:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:24,675 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-11-28 02:08:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:24,679 INFO L225 Difference]: With dead ends: 945 [2024-11-28 02:08:24,680 INFO L226 Difference]: Without dead ends: 541 [2024-11-28 02:08:24,681 INFO L434 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-11-28 02:08:24,682 INFO L435 NwaCegarLoop]: 654 mSDtfsCounter, 0 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:24,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 02:08:24,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2024-11-28 02:08:24,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2024-11-28 02:08:24,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 439 states have (on average 1.6150341685649203) internal successors, (709), 538 states have internal predecessors, (709), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:24,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 809 transitions. [2024-11-28 02:08:24,709 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 809 transitions. Word has length 24 [2024-11-28 02:08:24,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:24,710 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 809 transitions. [2024-11-28 02:08:24,710 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-11-28 02:08:24,710 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 809 transitions. [2024-11-28 02:08:24,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-28 02:08:24,711 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:24,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:24,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:08:24,711 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:08:24,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:24,712 INFO L85 PathProgramCache]: Analyzing trace with hash 2006306755, now seen corresponding path program 1 times [2024-11-28 02:08:24,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:24,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522321837] [2024-11-28 02:08:24,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:24,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:24,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:24,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:24,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:24,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522321837] [2024-11-28 02:08:24,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522321837] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:24,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:24,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:08:24,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262691760] [2024-11-28 02:08:24,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:24,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:24,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:24,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:24,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:24,832 INFO L87 Difference]: Start difference. First operand 541 states and 809 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-11-28 02:08:26,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:28,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:29,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:29,158 INFO L93 Difference]: Finished difference Result 1324 states and 2074 transitions. [2024-11-28 02:08:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:29,159 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-11-28 02:08:29,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:29,164 INFO L225 Difference]: With dead ends: 1324 [2024-11-28 02:08:29,164 INFO L226 Difference]: Without dead ends: 919 [2024-11-28 02:08:29,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:29,167 INFO L435 NwaCegarLoop]: 648 mSDtfsCounter, 580 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:29,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 1254 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-28 02:08:29,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-28 02:08:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 823. [2024-11-28 02:08:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 721 states have (on average 1.6893203883495145) internal successors, (1218), 820 states have internal predecessors, (1218), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1318 transitions. [2024-11-28 02:08:29,201 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1318 transitions. Word has length 24 [2024-11-28 02:08:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:29,202 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1318 transitions. [2024-11-28 02:08:29,202 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-11-28 02:08:29,202 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1318 transitions. [2024-11-28 02:08:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-28 02:08:29,203 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:29,203 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:29,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:08:29,203 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:08:29,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:29,204 INFO L85 PathProgramCache]: Analyzing trace with hash 2065250464, now seen corresponding path program 1 times [2024-11-28 02:08:29,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:29,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028905890] [2024-11-28 02:08:29,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:29,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:29,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:29,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:29,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028905890] [2024-11-28 02:08:29,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028905890] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:29,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:29,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:08:29,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869251001] [2024-11-28 02:08:29,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:29,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:29,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:29,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:29,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:29,336 INFO L87 Difference]: Start difference. First operand 823 states and 1318 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:33,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:33,758 INFO L93 Difference]: Finished difference Result 1502 states and 2465 transitions. [2024-11-28 02:08:33,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:33,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-28 02:08:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:33,768 INFO L225 Difference]: With dead ends: 1502 [2024-11-28 02:08:33,768 INFO L226 Difference]: Without dead ends: 1489 [2024-11-28 02:08:33,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:33,772 INFO L435 NwaCegarLoop]: 661 mSDtfsCounter, 611 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 1276 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:33,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 1276 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2024-11-28 02:08:33,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2024-11-28 02:08:33,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1396. [2024-11-28 02:08:33,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1294 states have (on average 1.7349304482225656) internal successors, (2245), 1393 states have internal predecessors, (2245), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:33,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 2345 transitions. [2024-11-28 02:08:33,836 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 2345 transitions. Word has length 25 [2024-11-28 02:08:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:33,837 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 2345 transitions. [2024-11-28 02:08:33,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 2345 transitions. [2024-11-28 02:08:33,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 02:08:33,840 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:33,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:33,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:08:33,841 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:08:33,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:33,841 INFO L85 PathProgramCache]: Analyzing trace with hash -402454971, now seen corresponding path program 1 times [2024-11-28 02:08:33,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:33,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880628594] [2024-11-28 02:08:33,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:33,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:33,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:33,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880628594] [2024-11-28 02:08:33,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880628594] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:33,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:33,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:08:33,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431946593] [2024-11-28 02:08:33,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:33,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:33,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:33,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:33,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:33,974 INFO L87 Difference]: Start difference. First operand 1396 states and 2345 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-11-28 02:08:35,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:36,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:39,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:40,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:42,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:46,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:50,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:51,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:51,375 INFO L93 Difference]: Finished difference Result 3819 states and 6580 transitions. [2024-11-28 02:08:51,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:51,376 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-11-28 02:08:51,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:51,389 INFO L225 Difference]: With dead ends: 3819 [2024-11-28 02:08:51,389 INFO L226 Difference]: Without dead ends: 2559 [2024-11-28 02:08:51,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:51,394 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 581 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 41 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:51,394 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1196 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 139 Invalid, 2 Unknown, 0 Unchecked, 17.3s Time] [2024-11-28 02:08:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2559 states. [2024-11-28 02:08:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2559 to 2486. [2024-11-28 02:08:51,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2486 states, 2384 states have (on average 1.7638422818791946) internal successors, (4205), 2483 states have internal predecessors, (4205), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2486 states to 2486 states and 4305 transitions. [2024-11-28 02:08:51,480 INFO L78 Accepts]: Start accepts. Automaton has 2486 states and 4305 transitions. Word has length 26 [2024-11-28 02:08:51,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:51,481 INFO L471 AbstractCegarLoop]: Abstraction has 2486 states and 4305 transitions. [2024-11-28 02:08:51,481 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-11-28 02:08:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2486 states and 4305 transitions. [2024-11-28 02:08:51,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-28 02:08:51,486 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:51,486 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:51,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:08:51,487 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:08:51,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:51,487 INFO L85 PathProgramCache]: Analyzing trace with hash -845354111, now seen corresponding path program 1 times [2024-11-28 02:08:51,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:51,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693707581] [2024-11-28 02:08:51,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:51,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:51,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:51,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693707581] [2024-11-28 02:08:51,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693707581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:51,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:51,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:08:51,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900355368] [2024-11-28 02:08:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:51,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:51,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:51,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:51,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:51,656 INFO L87 Difference]: Start difference. First operand 2486 states and 4305 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-11-28 02:08:51,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:51,757 INFO L93 Difference]: Finished difference Result 4820 states and 8421 transitions. [2024-11-28 02:08:51,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:51,759 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-11-28 02:08:51,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:51,782 INFO L225 Difference]: With dead ends: 4820 [2024-11-28 02:08:51,782 INFO L226 Difference]: Without dead ends: 4814 [2024-11-28 02:08:51,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:51,785 INFO L435 NwaCegarLoop]: 663 mSDtfsCounter, 639 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:51,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [639 Valid, 1297 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:08:51,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4814 states. [2024-11-28 02:08:51,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4814 to 4712. [2024-11-28 02:08:51,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 4610 states have (on average 1.7806941431670282) internal successors, (8209), 4709 states have internal predecessors, (8209), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:51,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 8309 transitions. [2024-11-28 02:08:51,926 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 8309 transitions. Word has length 26 [2024-11-28 02:08:51,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:51,928 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 8309 transitions. [2024-11-28 02:08:51,929 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-11-28 02:08:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 8309 transitions. [2024-11-28 02:08:51,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-28 02:08:51,931 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:51,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:51,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:08:51,931 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:08:51,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash 408094664, now seen corresponding path program 1 times [2024-11-28 02:08:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:51,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202744473] [2024-11-28 02:08:51,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:51,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:52,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:52,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202744473] [2024-11-28 02:08:52,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202744473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:52,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:52,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:08:52,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35677574] [2024-11-28 02:08:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:52,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:52,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:52,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:52,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:52,057 INFO L87 Difference]: Start difference. First operand 4712 states and 8309 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:55,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:08:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:08:55,224 INFO L93 Difference]: Finished difference Result 13701 states and 24326 transitions. [2024-11-28 02:08:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:08:55,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-28 02:08:55,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:08:55,273 INFO L225 Difference]: With dead ends: 13701 [2024-11-28 02:08:55,273 INFO L226 Difference]: Without dead ends: 9125 [2024-11-28 02:08:55,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:55,285 INFO L435 NwaCegarLoop]: 685 mSDtfsCounter, 603 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-28 02:08:55,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1323 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-28 02:08:55,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9125 states. [2024-11-28 02:08:55,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9125 to 9024. [2024-11-28 02:08:55,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9024 states, 8922 states have (on average 1.7831203765971755) internal successors, (15909), 9021 states have internal predecessors, (15909), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:55,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9024 states to 9024 states and 16009 transitions. [2024-11-28 02:08:55,572 INFO L78 Accepts]: Start accepts. Automaton has 9024 states and 16009 transitions. Word has length 27 [2024-11-28 02:08:55,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:08:55,573 INFO L471 AbstractCegarLoop]: Abstraction has 9024 states and 16009 transitions. [2024-11-28 02:08:55,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:55,573 INFO L276 IsEmpty]: Start isEmpty. Operand 9024 states and 16009 transitions. [2024-11-28 02:08:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-28 02:08:55,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:08:55,575 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:08:55,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:08:55,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:08:55,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:08:55,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1314669293, now seen corresponding path program 1 times [2024-11-28 02:08:55,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:08:55,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840177421] [2024-11-28 02:08:55,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:08:55,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:08:55,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:08:55,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:08:55,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:08:55,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840177421] [2024-11-28 02:08:55,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840177421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:08:55,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:08:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:08:55,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474151624] [2024-11-28 02:08:55,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:08:55,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:08:55,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:08:55,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:08:55,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:08:55,698 INFO L87 Difference]: Start difference. First operand 9024 states and 16009 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:08:57,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:09:00,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:09:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:00,335 INFO L93 Difference]: Finished difference Result 26414 states and 47011 transitions. [2024-11-28 02:09:00,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:00,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 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 29 [2024-11-28 02:09:00,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:00,388 INFO L225 Difference]: With dead ends: 26414 [2024-11-28 02:09:00,388 INFO L226 Difference]: Without dead ends: 17526 [2024-11-28 02:09:00,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:00,402 INFO L435 NwaCegarLoop]: 723 mSDtfsCounter, 594 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:00,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 1351 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-28 02:09:00,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17526 states. [2024-11-28 02:09:00,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17526 to 17424. [2024-11-28 02:09:00,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17424 states, 17322 states have (on average 1.7797598429742525) internal successors, (30829), 17421 states have internal predecessors, (30829), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17424 states to 17424 states and 30929 transitions. [2024-11-28 02:09:00,806 INFO L78 Accepts]: Start accepts. Automaton has 17424 states and 30929 transitions. Word has length 29 [2024-11-28 02:09:00,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:00,810 INFO L471 AbstractCegarLoop]: Abstraction has 17424 states and 30929 transitions. [2024-11-28 02:09:00,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 17424 states and 30929 transitions. [2024-11-28 02:09:00,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-28 02:09:00,811 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:00,811 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:00,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:09:00,812 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:00,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:00,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2099359570, now seen corresponding path program 1 times [2024-11-28 02:09:00,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:00,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042819627] [2024-11-28 02:09:00,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:00,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:00,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:00,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:00,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042819627] [2024-11-28 02:09:00,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042819627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:00,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:00,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:09:00,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525514653] [2024-11-28 02:09:00,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:00,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:00,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:00,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:00,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:00,921 INFO L87 Difference]: Start difference. First operand 17424 states and 30929 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:01,434 INFO L93 Difference]: Finished difference Result 34712 states and 61702 transitions. [2024-11-28 02:09:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:01,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 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 30 [2024-11-28 02:09:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:01,527 INFO L225 Difference]: With dead ends: 34712 [2024-11-28 02:09:01,527 INFO L226 Difference]: Without dead ends: 34709 [2024-11-28 02:09:01,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:01,540 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 623 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:01,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1344 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-28 02:09:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34709 states. [2024-11-28 02:09:02,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34709 to 34608. [2024-11-28 02:09:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34608 states, 34506 states have (on average 1.780472961224135) internal successors, (61437), 34605 states have internal predecessors, (61437), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:02,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34608 states to 34608 states and 61537 transitions. [2024-11-28 02:09:02,320 INFO L78 Accepts]: Start accepts. Automaton has 34608 states and 61537 transitions. Word has length 30 [2024-11-28 02:09:02,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:02,320 INFO L471 AbstractCegarLoop]: Abstraction has 34608 states and 61537 transitions. [2024-11-28 02:09:02,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 34608 states and 61537 transitions. [2024-11-28 02:09:02,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-28 02:09:02,323 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:02,323 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:02,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 02:09:02,324 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:02,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:02,324 INFO L85 PathProgramCache]: Analyzing trace with hash 856506849, now seen corresponding path program 1 times [2024-11-28 02:09:02,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:02,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320449422] [2024-11-28 02:09:02,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:02,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:02,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:02,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:02,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320449422] [2024-11-28 02:09:02,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320449422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:02,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:02,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:09:02,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771223144] [2024-11-28 02:09:02,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:02,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:02,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:02,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:02,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:02,434 INFO L87 Difference]: Start difference. First operand 34608 states and 61537 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:06,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:09:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:06,803 INFO L93 Difference]: Finished difference Result 102779 states and 182902 transitions. [2024-11-28 02:09:06,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:06,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 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 31 [2024-11-28 02:09:06,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:06,994 INFO L225 Difference]: With dead ends: 102779 [2024-11-28 02:09:06,995 INFO L226 Difference]: Without dead ends: 68173 [2024-11-28 02:09:07,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:07,038 INFO L435 NwaCegarLoop]: 659 mSDtfsCounter, 620 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:07,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1290 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-28 02:09:07,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68173 states. [2024-11-28 02:09:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68173 to 68073. [2024-11-28 02:09:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68073 states, 67971 states have (on average 1.7741242588751085) internal successors, (120589), 68070 states have internal predecessors, (120589), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:08,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68073 states to 68073 states and 120689 transitions. [2024-11-28 02:09:08,402 INFO L78 Accepts]: Start accepts. Automaton has 68073 states and 120689 transitions. Word has length 31 [2024-11-28 02:09:08,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:08,402 INFO L471 AbstractCegarLoop]: Abstraction has 68073 states and 120689 transitions. [2024-11-28 02:09:08,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 2 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 68073 states and 120689 transitions. [2024-11-28 02:09:08,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 02:09:08,409 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:08,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:08,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:09:08,410 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:08,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:08,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1897923797, now seen corresponding path program 1 times [2024-11-28 02:09:08,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:08,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514132359] [2024-11-28 02:09:08,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:08,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:08,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:08,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:08,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514132359] [2024-11-28 02:09:08,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514132359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:08,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:08,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:09:08,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539424875] [2024-11-28 02:09:08,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:08,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:08,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:08,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:08,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:08,524 INFO L87 Difference]: Start difference. First operand 68073 states and 120689 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:13,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:09:13,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:13,781 INFO L93 Difference]: Finished difference Result 169074 states and 299931 transitions. [2024-11-28 02:09:13,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:13,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 02:09:13,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:14,135 INFO L225 Difference]: With dead ends: 169074 [2024-11-28 02:09:14,136 INFO L226 Difference]: Without dead ends: 101003 [2024-11-28 02:09:14,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:14,192 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 630 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:14,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 1318 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-11-28 02:09:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101003 states. [2024-11-28 02:09:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101003 to 100899. [2024-11-28 02:09:15,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100899 states, 100797 states have (on average 1.7737135033780767) internal successors, (178785), 100896 states have internal predecessors, (178785), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:15,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100899 states to 100899 states and 178885 transitions. [2024-11-28 02:09:15,908 INFO L78 Accepts]: Start accepts. Automaton has 100899 states and 178885 transitions. Word has length 32 [2024-11-28 02:09:15,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:15,909 INFO L471 AbstractCegarLoop]: Abstraction has 100899 states and 178885 transitions. [2024-11-28 02:09:15,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:15,909 INFO L276 IsEmpty]: Start isEmpty. Operand 100899 states and 178885 transitions. [2024-11-28 02:09:15,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-28 02:09:15,910 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:15,910 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:15,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:09:15,911 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:15,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:15,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1171709481, now seen corresponding path program 1 times [2024-11-28 02:09:15,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:15,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024274492] [2024-11-28 02:09:15,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:15,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:16,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:16,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024274492] [2024-11-28 02:09:16,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024274492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:16,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:16,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:09:16,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368925515] [2024-11-28 02:09:16,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:16,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:16,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:16,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:16,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:16,054 INFO L87 Difference]: Start difference. First operand 100899 states and 178885 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:17,228 INFO L93 Difference]: Finished difference Result 201675 states and 357642 transitions. [2024-11-28 02:09:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:17,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-28 02:09:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:17,585 INFO L225 Difference]: With dead ends: 201675 [2024-11-28 02:09:17,585 INFO L226 Difference]: Without dead ends: 201671 [2024-11-28 02:09:17,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:17,634 INFO L435 NwaCegarLoop]: 652 mSDtfsCounter, 620 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 1293 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:17,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [620 Valid, 1293 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 02:09:17,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201671 states. [2024-11-28 02:09:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201671 to 201571. [2024-11-28 02:09:20,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201571 states, 201469 states have (on average 1.7703616933622544) internal successors, (356673), 201568 states have internal predecessors, (356673), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201571 states to 201571 states and 356773 transitions. [2024-11-28 02:09:20,878 INFO L78 Accepts]: Start accepts. Automaton has 201571 states and 356773 transitions. Word has length 32 [2024-11-28 02:09:20,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:20,881 INFO L471 AbstractCegarLoop]: Abstraction has 201571 states and 356773 transitions. [2024-11-28 02:09:20,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 2 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:20,881 INFO L276 IsEmpty]: Start isEmpty. Operand 201571 states and 356773 transitions. [2024-11-28 02:09:20,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-28 02:09:20,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:20,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:09:20,883 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:20,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash -752572324, now seen corresponding path program 1 times [2024-11-28 02:09:20,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:20,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854647230] [2024-11-28 02:09:20,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:20,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:20,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:20,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:20,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854647230] [2024-11-28 02:09:20,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854647230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:20,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:20,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:09:20,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057169370] [2024-11-28 02:09:20,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:20,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:20,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:21,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:21,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:21,000 INFO L87 Difference]: Start difference. First operand 201571 states and 356773 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:22,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:22,871 INFO L93 Difference]: Finished difference Result 236046 states and 418092 transitions. [2024-11-28 02:09:22,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:22,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-28 02:09:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:23,176 INFO L225 Difference]: With dead ends: 236046 [2024-11-28 02:09:23,176 INFO L226 Difference]: Without dead ends: 236040 [2024-11-28 02:09:23,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:23,229 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 616 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:23,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 1328 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 02:09:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236040 states. [2024-11-28 02:09:26,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236040 to 235939. [2024-11-28 02:09:26,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235939 states, 235837 states have (on average 1.7675979596076952) internal successors, (416865), 235936 states have internal predecessors, (416865), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235939 states to 235939 states and 416965 transitions. [2024-11-28 02:09:27,730 INFO L78 Accepts]: Start accepts. Automaton has 235939 states and 416965 transitions. Word has length 34 [2024-11-28 02:09:27,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:27,734 INFO L471 AbstractCegarLoop]: Abstraction has 235939 states and 416965 transitions. [2024-11-28 02:09:27,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 235939 states and 416965 transitions. [2024-11-28 02:09:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 02:09:27,735 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:27,735 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:27,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:09:27,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:27,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:27,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1855554468, now seen corresponding path program 1 times [2024-11-28 02:09:27,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:27,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919694071] [2024-11-28 02:09:27,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:27,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:27,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:27,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919694071] [2024-11-28 02:09:27,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919694071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:27,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:27,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:09:27,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833021954] [2024-11-28 02:09:27,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:27,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:09:27,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:27,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:09:27,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:27,894 INFO L87 Difference]: Start difference. First operand 235939 states and 416965 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:29,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:09:32,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:09:33,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:09:39,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:09:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:09:43,389 INFO L93 Difference]: Finished difference Result 609412 states and 1078306 transitions. [2024-11-28 02:09:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:09:43,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-28 02:09:43,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:09:43,866 INFO L225 Difference]: With dead ends: 609412 [2024-11-28 02:09:43,867 INFO L226 Difference]: Without dead ends: 373596 [2024-11-28 02:09:43,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:09:43,970 INFO L435 NwaCegarLoop]: 737 mSDtfsCounter, 529 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 1267 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.8s IncrementalHoareTripleChecker+Time [2024-11-28 02:09:43,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 1267 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 145 Invalid, 1 Unknown, 0 Unchecked, 12.8s Time] [2024-11-28 02:09:44,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373596 states. [2024-11-28 02:09:48,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373596 to 373523. [2024-11-28 02:09:48,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373523 states, 373421 states have (on average 1.7386087017066527) internal successors, (649233), 373520 states have internal predecessors, (649233), 100 states have call successors, (100), 2 states have call predecessors, (100), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:49,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373523 states to 373523 states and 649333 transitions. [2024-11-28 02:09:49,889 INFO L78 Accepts]: Start accepts. Automaton has 373523 states and 649333 transitions. Word has length 35 [2024-11-28 02:09:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:09:49,890 INFO L471 AbstractCegarLoop]: Abstraction has 373523 states and 649333 transitions. [2024-11-28 02:09:49,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:49,890 INFO L276 IsEmpty]: Start isEmpty. Operand 373523 states and 649333 transitions. [2024-11-28 02:09:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-28 02:09:49,895 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:09:49,895 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:09:49,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 02:09:49,895 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION === [reach_error_aErr0ASSERT_VIOLATIONERROR_FUNCTION, reach_error_bErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:09:49,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:09:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash -615204192, now seen corresponding path program 1 times [2024-11-28 02:09:49,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:09:49,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227494194] [2024-11-28 02:09:49,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:09:49,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:09:49,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:09:50,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:09:50,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:09:50,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227494194] [2024-11-28 02:09:50,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227494194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:09:50,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:09:50,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:09:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646222663] [2024-11-28 02:09:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:09:50,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:09:50,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:09:50,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:09:50,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:09:50,042 INFO L87 Difference]: Start difference. First operand 373523 states and 649333 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 02:09:52,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:09:55,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:09:56,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:01,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:04,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:07,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:11,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:13,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:19,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:24,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:27,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:31,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:33,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:34,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:36,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:39,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:40,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:44,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:47,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-11-28 02:10:49,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []