/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:18:56,511 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:18:56,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 08:18:56,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:18:56,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:18:56,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:18:56,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:18:56,596 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:18:56,596 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:18:56,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:18:56,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:18:56,599 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:18:56,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:18:56,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:18:56,600 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:18:56,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:18:56,600 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:18:56,600 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:18:56,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:18:56,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:18:56,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:18:56,602 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:18:56,602 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:18:56,602 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:18:56,602 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:18:56,603 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:18:56,603 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:18:56,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:18:56,603 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:18:56,603 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:18:56,603 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:18:56,603 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:18:56,604 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:18:56,604 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:18:56,604 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:18:56,604 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:18:56,604 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:18:56,604 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:18:56,604 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:18:56,605 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:18:56,605 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:18:56,606 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:56,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:18:56,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:18:56,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:18:56,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:18:56,800 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:18:56,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2024-11-05 08:18:58,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:18:58,437 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:18:58,437 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2024-11-05 08:18:58,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15345cbd1/d2492ef28900401f81707f8deef7af63/FLAGd8611b12a [2024-11-05 08:18:58,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15345cbd1/d2492ef28900401f81707f8deef7af63 [2024-11-05 08:18:58,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:18:58,482 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:18:58,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:18:58,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:18:58,487 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:18:58,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:18:58" (1/1) ... [2024-11-05 08:18:58,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab970bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:58, skipping insertion in model container [2024-11-05 08:18:58,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:18:58" (1/1) ... [2024-11-05 08:18:58,574 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:18:58,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2024-11-05 08:18:58,776 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2024-11-05 08:18:59,141 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,205 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,206 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,206 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,218 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,219 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,219 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,220 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,222 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,222 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,223 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,226 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,226 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,229 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,229 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,238 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,238 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,239 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,239 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,243 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,243 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,244 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,244 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,245 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,245 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,246 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,246 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,247 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,248 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,472 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,473 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,473 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,473 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,564 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:59,611 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 08:18:59,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:18:59,633 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2024-11-05 08:18:59,634 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2024-11-05 08:18:59,648 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,656 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,657 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,657 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,660 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,661 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,661 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,661 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,662 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,662 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,662 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,663 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,664 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,664 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,665 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,667 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,668 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,668 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,668 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,669 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,669 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,669 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,670 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,670 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,671 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,671 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,671 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,671 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,671 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,713 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,713 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,714 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,714 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,741 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:59,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:59,755 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:18:59,767 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2024-11-05 08:18:59,768 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2024-11-05 08:18:59,801 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,801 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,801 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,802 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,802 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,806 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,806 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,808 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,809 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,809 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,810 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,810 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,810 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:59,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:59,984 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 08:18:59,991 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:18:59,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59 WrapperNode [2024-11-05 08:18:59,991 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:18:59,992 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:18:59,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:18:59,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:18:59,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,052 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,083 INFO L138 Inliner]: procedures = 687, calls = 1039, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 144 [2024-11-05 08:19:00,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:19:00,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:19:00,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:19:00,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:19:00,092 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,098 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,119 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-05 08:19:00,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,122 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,138 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,141 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,160 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:19:00,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:19:00,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:19:00,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:19:00,161 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (1/1) ... [2024-11-05 08:19:00,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:19:00,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:19:00,192 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-05 08:19:00,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-05 08:19:00,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:19:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:19:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:19:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:19:00,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 08:19:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 08:19:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:19:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:19:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-05 08:19:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-05 08:19:00,214 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-05 08:19:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:19:00,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 08:19:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 08:19:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 08:19:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:19:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:19:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:19:00,215 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:19:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:19:00,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 08:19:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 08:19:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 08:19:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 08:19:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 08:19:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 08:19:00,216 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-05 08:19:00,216 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-05 08:19:00,448 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:19:00,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:19:00,760 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-05 08:19:00,760 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:19:00,782 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:19:00,783 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 08:19:00,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:19:00 BoogieIcfgContainer [2024-11-05 08:19:00,783 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:19:00,785 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:19:00,785 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:19:00,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:19:00,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:18:58" (1/3) ... [2024-11-05 08:19:00,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2efa1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:19:00, skipping insertion in model container [2024-11-05 08:19:00,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:59" (2/3) ... [2024-11-05 08:19:00,792 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2efa1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:19:00, skipping insertion in model container [2024-11-05 08:19:00,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:19:00" (3/3) ... [2024-11-05 08:19:00,793 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness_negated.i [2024-11-05 08:19:00,808 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:19:00,808 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:19:00,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:19:00,862 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;@198989a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:19:00,862 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:19:00,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-05 08:19:00,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-05 08:19:00,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:00,884 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-05 08:19:00,885 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:00,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:00,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1062572114, now seen corresponding path program 1 times [2024-11-05 08:19:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:00,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1261737342] [2024-11-05 08:19:00,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:00,896 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:00,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:00,899 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:00,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-05 08:19:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:01,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:19:01,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-05 08:19:01,159 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:01,209 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-05 08:19:01,209 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:01,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1261737342] [2024-11-05 08:19:01,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1261737342] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:01,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:01,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 08:19:01,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624509284] [2024-11-05 08:19:01,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:01,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:19:01,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:01,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:19:01,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:19:01,232 INFO L87 Difference]: Start difference. First operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:01,250 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2024-11-05 08:19:01,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:19:01,252 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-05 08:19:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:01,257 INFO L225 Difference]: With dead ends: 130 [2024-11-05 08:19:01,257 INFO L226 Difference]: Without dead ends: 64 [2024-11-05 08:19:01,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:19:01,262 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:01,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:01,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-05 08:19:01,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-05 08:19:01,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-05 08:19:01,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-11-05 08:19:01,287 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 68 [2024-11-05 08:19:01,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:01,287 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-11-05 08:19:01,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:01,288 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-05 08:19:01,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-05 08:19:01,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:01,290 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-05 08:19:01,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 08:19:01,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:01,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:01,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:01,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1946087212, now seen corresponding path program 1 times [2024-11-05 08:19:01,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:01,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [880346064] [2024-11-05 08:19:01,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:01,495 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:01,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:01,498 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:01,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-05 08:19:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:01,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:19:01,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:01,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:01,773 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-05 08:19:01,773 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:01,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [880346064] [2024-11-05 08:19:01,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [880346064] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:01,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:01,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-05 08:19:01,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807545272] [2024-11-05 08:19:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:01,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:19:01,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:01,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:19:01,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:01,776 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-05 08:19:01,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:01,823 INFO L93 Difference]: Finished difference Result 116 states and 154 transitions. [2024-11-05 08:19:01,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:01,823 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-05 08:19:01,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:01,825 INFO L225 Difference]: With dead ends: 116 [2024-11-05 08:19:01,825 INFO L226 Difference]: Without dead ends: 66 [2024-11-05 08:19:01,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:01,828 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:01,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 382 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:01,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-05 08:19:01,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-05 08:19:01,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-11-05 08:19:01,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 87 transitions. [2024-11-05 08:19:01,839 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 87 transitions. Word has length 68 [2024-11-05 08:19:01,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:01,840 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 87 transitions. [2024-11-05 08:19:01,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-05 08:19:01,840 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2024-11-05 08:19:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-05 08:19:01,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:01,841 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:19:01,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-05 08:19:02,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:02,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:02,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:02,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1195332088, now seen corresponding path program 1 times [2024-11-05 08:19:02,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:02,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2051594302] [2024-11-05 08:19:02,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:02,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:02,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:02,046 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:02,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-05 08:19:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:02,201 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:19:02,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:02,277 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 08:19:02,277 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-05 08:19:02,428 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:02,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2051594302] [2024-11-05 08:19:02,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2051594302] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:02,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:02,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2024-11-05 08:19:02,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259857912] [2024-11-05 08:19:02,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:02,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:19:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:02,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:19:02,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:19:02,429 INFO L87 Difference]: Start difference. First operand 66 states and 87 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:02,530 INFO L93 Difference]: Finished difference Result 123 states and 165 transitions. [2024-11-05 08:19:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:02,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-05 08:19:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:02,532 INFO L225 Difference]: With dead ends: 123 [2024-11-05 08:19:02,532 INFO L226 Difference]: Without dead ends: 71 [2024-11-05 08:19:02,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:19:02,533 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 21 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:02,533 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 300 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:19:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-05 08:19:02,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2024-11-05 08:19:02,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 51 states have internal predecessors, (61), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-05 08:19:02,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-11-05 08:19:02,544 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 70 [2024-11-05 08:19:02,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:02,544 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-11-05 08:19:02,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-11-05 08:19:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-05 08:19:02,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:02,545 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:19:02,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 08:19:02,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:02,746 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:02,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:02,747 INFO L85 PathProgramCache]: Analyzing trace with hash -316025515, now seen corresponding path program 1 times [2024-11-05 08:19:02,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:02,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1647341202] [2024-11-05 08:19:02,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:02,747 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:02,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:02,750 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:02,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-05 08:19:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:02,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:19:02,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 08:19:02,999 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-05 08:19:03,164 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:03,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1647341202] [2024-11-05 08:19:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1647341202] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:03,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:03,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2024-11-05 08:19:03,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204331475] [2024-11-05 08:19:03,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:03,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:19:03,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:03,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:19:03,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:19:03,165 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:03,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:03,326 INFO L93 Difference]: Finished difference Result 135 states and 183 transitions. [2024-11-05 08:19:03,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:19:03,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-05 08:19:03,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:03,328 INFO L225 Difference]: With dead ends: 135 [2024-11-05 08:19:03,328 INFO L226 Difference]: Without dead ends: 80 [2024-11-05 08:19:03,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-05 08:19:03,329 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 30 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:03,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 354 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:19:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-05 08:19:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 71. [2024-11-05 08:19:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-05 08:19:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-05 08:19:03,336 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 72 [2024-11-05 08:19:03,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:03,336 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-05 08:19:03,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:03,336 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-05 08:19:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-05 08:19:03,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:03,337 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:19:03,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-05 08:19:03,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:03,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:03,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1928092350, now seen corresponding path program 1 times [2024-11-05 08:19:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [218329810] [2024-11-05 08:19:03,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:03,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:03,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:03,544 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:03,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-05 08:19:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:03,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:19:03,720 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:03,776 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 08:19:03,776 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-05 08:19:03,813 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:03,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [218329810] [2024-11-05 08:19:03,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [218329810] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:03,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:03,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [3] total 7 [2024-11-05 08:19:03,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468748161] [2024-11-05 08:19:03,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:03,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:19:03,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:03,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:19:03,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:03,815 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:03,900 INFO L93 Difference]: Finished difference Result 135 states and 185 transitions. [2024-11-05 08:19:03,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:03,901 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2024-11-05 08:19:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:03,902 INFO L225 Difference]: With dead ends: 135 [2024-11-05 08:19:03,902 INFO L226 Difference]: Without dead ends: 78 [2024-11-05 08:19:03,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:03,903 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:03,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 230 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:19:03,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-05 08:19:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 72. [2024-11-05 08:19:03,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-05 08:19:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-11-05 08:19:03,911 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 73 [2024-11-05 08:19:03,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:03,911 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-11-05 08:19:03,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-05 08:19:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-11-05 08:19:03,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-05 08:19:03,912 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:03,912 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:19:03,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-05 08:19:04,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:04,117 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:04,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:04,117 INFO L85 PathProgramCache]: Analyzing trace with hash 137287748, now seen corresponding path program 1 times [2024-11-05 08:19:04,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:04,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [516994539] [2024-11-05 08:19:04,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:04,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:04,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:04,120 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:04,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-05 08:19:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:04,259 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:19:04,261 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:04,291 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-05 08:19:04,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-05 08:19:04,346 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:04,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [516994539] [2024-11-05 08:19:04,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [516994539] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:04,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:04,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-05 08:19:04,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349953803] [2024-11-05 08:19:04,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:04,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:19:04,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:04,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:19:04,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:19:04,347 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-05 08:19:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:04,386 INFO L93 Difference]: Finished difference Result 136 states and 183 transitions. [2024-11-05 08:19:04,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:19:04,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-11-05 08:19:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:04,387 INFO L225 Difference]: With dead ends: 136 [2024-11-05 08:19:04,387 INFO L226 Difference]: Without dead ends: 78 [2024-11-05 08:19:04,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:19:04,388 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:04,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 452 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:04,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-05 08:19:04,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2024-11-05 08:19:04,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-05 08:19:04,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-05 08:19:04,397 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 81 [2024-11-05 08:19:04,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:04,397 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-05 08:19:04,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 6 states have internal predecessors, (54), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-05 08:19:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-05 08:19:04,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-05 08:19:04,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:04,398 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:19:04,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-05 08:19:04,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:04,602 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:04,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:04,603 INFO L85 PathProgramCache]: Analyzing trace with hash 431382673, now seen corresponding path program 1 times [2024-11-05 08:19:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:04,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1347252153] [2024-11-05 08:19:04,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:04,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:04,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:04,605 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:04,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-05 08:19:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:04,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 08:19:04,776 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:08,949 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2024-11-05 08:19:09,143 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 26 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 08:19:09,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-05 08:19:09,354 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:09,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1347252153] [2024-11-05 08:19:09,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1347252153] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:09,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:09,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-05 08:19:09,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159852025] [2024-11-05 08:19:09,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:09,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 08:19:09,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:09,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 08:19:09,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-05 08:19:09,356 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-05 08:19:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:10,215 INFO L93 Difference]: Finished difference Result 173 states and 247 transitions. [2024-11-05 08:19:10,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-05 08:19:10,218 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 83 [2024-11-05 08:19:10,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:10,220 INFO L225 Difference]: With dead ends: 173 [2024-11-05 08:19:10,220 INFO L226 Difference]: Without dead ends: 114 [2024-11-05 08:19:10,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 153 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=42, Invalid=143, Unknown=1, NotChecked=24, Total=210 [2024-11-05 08:19:10,221 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 31 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 225 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:10,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 588 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 329 Invalid, 0 Unknown, 225 Unchecked, 0.7s Time] [2024-11-05 08:19:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-05 08:19:10,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2024-11-05 08:19:10,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 70 states have internal predecessors, (87), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-05 08:19:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2024-11-05 08:19:10,252 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 83 [2024-11-05 08:19:10,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:10,252 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2024-11-05 08:19:10,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-05 08:19:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2024-11-05 08:19:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-05 08:19:10,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:10,261 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:19:10,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-05 08:19:10,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:10,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:10,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:10,462 INFO L85 PathProgramCache]: Analyzing trace with hash 13986067, now seen corresponding path program 1 times [2024-11-05 08:19:10,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:10,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [76852909] [2024-11-05 08:19:10,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:10,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:10,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:10,464 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:10,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-05 08:19:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:10,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 08:19:10,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-05 08:19:10,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:10,672 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:19:10,672 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:10,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [76852909] [2024-11-05 08:19:10,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [76852909] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:10,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:10,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-05 08:19:10,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180941933] [2024-11-05 08:19:10,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:10,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:19:10,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:10,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:19:10,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:19:10,674 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 08:19:10,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:10,697 INFO L93 Difference]: Finished difference Result 167 states and 233 transitions. [2024-11-05 08:19:10,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:19:10,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2024-11-05 08:19:10,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:10,698 INFO L225 Difference]: With dead ends: 167 [2024-11-05 08:19:10,698 INFO L226 Difference]: Without dead ends: 91 [2024-11-05 08:19:10,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:19:10,699 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:10,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 237 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:10,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-05 08:19:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-05 08:19:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.2835820895522387) internal successors, (86), 70 states have internal predecessors, (86), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-05 08:19:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2024-11-05 08:19:10,707 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 83 [2024-11-05 08:19:10,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:10,707 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2024-11-05 08:19:10,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 08:19:10,707 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2024-11-05 08:19:10,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-05 08:19:10,708 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:10,708 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:19:10,716 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-05 08:19:10,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:10,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:10,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:10,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1975560725, now seen corresponding path program 1 times [2024-11-05 08:19:10,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:10,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2062588367] [2024-11-05 08:19:10,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:10,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:10,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:10,911 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:10,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-05 08:19:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:11,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:19:11,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-05 08:19:11,063 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:11,091 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:19:11,091 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:11,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2062588367] [2024-11-05 08:19:11,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2062588367] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:11,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:11,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-05 08:19:11,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336073641] [2024-11-05 08:19:11,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:11,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:19:11,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:11,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:19:11,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:19:11,092 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 08:19:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:11,118 INFO L93 Difference]: Finished difference Result 166 states and 231 transitions. [2024-11-05 08:19:11,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:19:11,119 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2024-11-05 08:19:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:11,119 INFO L225 Difference]: With dead ends: 166 [2024-11-05 08:19:11,119 INFO L226 Difference]: Without dead ends: 90 [2024-11-05 08:19:11,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:19:11,120 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:11,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-05 08:19:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-05 08:19:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.25) internal successors, (80), 67 states have internal predecessors, (80), 14 states have call successors, (14), 6 states have call predecessors, (14), 8 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-05 08:19:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 113 transitions. [2024-11-05 08:19:11,133 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 113 transitions. Word has length 83 [2024-11-05 08:19:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:11,133 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 113 transitions. [2024-11-05 08:19:11,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-05 08:19:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 113 transitions. [2024-11-05 08:19:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:19:11,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:11,134 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:19:11,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-05 08:19:11,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:11,334 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:11,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:11,335 INFO L85 PathProgramCache]: Analyzing trace with hash -233275002, now seen corresponding path program 1 times [2024-11-05 08:19:11,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:11,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [421633338] [2024-11-05 08:19:11,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:11,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:11,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:11,336 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:11,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-05 08:19:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:11,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-05 08:19:11,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:12,445 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 43 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 08:19:12,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:13,854 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:19:13,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-05 08:19:13,868 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-05 08:19:13,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-11-05 08:19:13,904 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-05 08:19:13,905 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:13,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [421633338] [2024-11-05 08:19:13,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [421633338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:13,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:13,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2024-11-05 08:19:13,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884568183] [2024-11-05 08:19:13,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:13,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 08:19:13,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:13,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 08:19:13,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:19:13,906 INFO L87 Difference]: Start difference. First operand 87 states and 113 transitions. Second operand has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-05 08:19:18,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:22,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:26,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:30,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:34,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:36,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:36,366 INFO L93 Difference]: Finished difference Result 217 states and 277 transitions. [2024-11-05 08:19:36,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 08:19:36,370 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 84 [2024-11-05 08:19:36,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:36,372 INFO L225 Difference]: With dead ends: 217 [2024-11-05 08:19:36,372 INFO L226 Difference]: Without dead ends: 132 [2024-11-05 08:19:36,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2024-11-05 08:19:36,373 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 116 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 51 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.9s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:36,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 683 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 376 Invalid, 5 Unknown, 0 Unchecked, 21.9s Time] [2024-11-05 08:19:36,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-05 08:19:36,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2024-11-05 08:19:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 97 states have (on average 1.2268041237113403) internal successors, (119), 99 states have internal predecessors, (119), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-05 08:19:36,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 154 transitions. [2024-11-05 08:19:36,393 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 154 transitions. Word has length 84 [2024-11-05 08:19:36,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:36,394 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 154 transitions. [2024-11-05 08:19:36,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 5.9411764705882355) internal successors, (101), 17 states have internal predecessors, (101), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-05 08:19:36,398 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 154 transitions. [2024-11-05 08:19:36,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:19:36,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:36,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:19:36,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-05 08:19:36,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:36,603 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:36,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash -980582014, now seen corresponding path program 1 times [2024-11-05 08:19:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:36,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1165792896] [2024-11-05 08:19:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:36,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:36,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:36,607 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:36,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-05 08:19:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:36,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-05 08:19:36,784 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:36,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-05 08:19:37,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:19:37,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-05 08:19:38,305 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-05 08:19:38,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:39,161 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-05 08:19:39,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 103 [2024-11-05 08:19:39,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:19:39,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 95 treesize of output 97 [2024-11-05 08:19:39,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-11-05 08:19:39,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-05 08:19:39,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-05 08:19:39,581 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-05 08:19:39,581 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:39,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1165792896] [2024-11-05 08:19:39,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1165792896] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:39,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:39,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [10] total 19 [2024-11-05 08:19:39,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102820640] [2024-11-05 08:19:39,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:39,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-05 08:19:39,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:39,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-05 08:19:39,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:19:39,588 INFO L87 Difference]: Start difference. First operand 125 states and 154 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-05 08:19:42,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:42,009 INFO L93 Difference]: Finished difference Result 308 states and 387 transitions. [2024-11-05 08:19:42,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 08:19:42,010 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 84 [2024-11-05 08:19:42,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:42,011 INFO L225 Difference]: With dead ends: 308 [2024-11-05 08:19:42,011 INFO L226 Difference]: Without dead ends: 238 [2024-11-05 08:19:42,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 145 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2024-11-05 08:19:42,012 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 34 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:42,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 509 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-05 08:19:42,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-05 08:19:42,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-05 08:19:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 183 states have (on average 1.2349726775956285) internal successors, (226), 187 states have internal predecessors, (226), 30 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (36), 28 states have call predecessors, (36), 28 states have call successors, (36) [2024-11-05 08:19:42,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 292 transitions. [2024-11-05 08:19:42,065 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 292 transitions. Word has length 84 [2024-11-05 08:19:42,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:42,065 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 292 transitions. [2024-11-05 08:19:42,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-05 08:19:42,066 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 292 transitions. [2024-11-05 08:19:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:19:42,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:42,071 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:19:42,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-05 08:19:42,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:42,272 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:42,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1883082114, now seen corresponding path program 1 times [2024-11-05 08:19:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:42,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692621665] [2024-11-05 08:19:42,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:42,273 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:42,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:42,275 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:42,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-05 08:19:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:42,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-05 08:19:42,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 40 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 08:19:44,407 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:46,786 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:19:46,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-05 08:19:46,821 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-05 08:19:46,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-11-05 08:19:46,856 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-05 08:19:46,857 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:46,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692621665] [2024-11-05 08:19:46,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [692621665] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:46,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:46,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2024-11-05 08:19:46,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138144592] [2024-11-05 08:19:46,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:46,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-05 08:19:46,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:46,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-05 08:19:46,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-11-05 08:19:46,861 INFO L87 Difference]: Start difference. First operand 234 states and 292 transitions. Second operand has 23 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-05 08:19:50,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:55,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:59,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:20:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:03,231 INFO L93 Difference]: Finished difference Result 370 states and 472 transitions. [2024-11-05 08:20:03,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 08:20:03,232 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) Word has length 84 [2024-11-05 08:20:03,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:03,238 INFO L225 Difference]: With dead ends: 370 [2024-11-05 08:20:03,238 INFO L226 Difference]: Without dead ends: 238 [2024-11-05 08:20:03,239 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 145 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2024-11-05 08:20:03,240 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 100 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 50 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 967 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:03,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 967 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 671 Invalid, 3 Unknown, 0 Unchecked, 15.7s Time] [2024-11-05 08:20:03,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-05 08:20:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 234. [2024-11-05 08:20:03,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 183 states have (on average 1.2240437158469946) internal successors, (224), 187 states have internal predecessors, (224), 30 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (36), 28 states have call predecessors, (36), 28 states have call successors, (36) [2024-11-05 08:20:03,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 290 transitions. [2024-11-05 08:20:03,309 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 290 transitions. Word has length 84 [2024-11-05 08:20:03,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:03,310 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 290 transitions. [2024-11-05 08:20:03,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 4.857142857142857) internal successors, (102), 21 states have internal predecessors, (102), 8 states have call successors, (17), 4 states have call predecessors, (17), 7 states have return successors, (16), 6 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-05 08:20:03,310 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 290 transitions. [2024-11-05 08:20:03,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:20:03,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:03,311 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:20:03,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-05 08:20:03,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:03,515 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:03,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:03,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1602284422, now seen corresponding path program 1 times [2024-11-05 08:20:03,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:03,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [22075523] [2024-11-05 08:20:03,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:03,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:03,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:03,519 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:20:03,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-05 08:20:03,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:03,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 08:20:03,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:20:04,856 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:05,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:20:05,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-11-05 08:20:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-05 08:20:06,568 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:06,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [22075523] [2024-11-05 08:20:06,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [22075523] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:20:06,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:20:06,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 27 [2024-11-05 08:20:06,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617767434] [2024-11-05 08:20:06,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:20:06,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-05 08:20:06,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:06,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-05 08:20:06,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=617, Unknown=0, NotChecked=0, Total=702 [2024-11-05 08:20:06,572 INFO L87 Difference]: Start difference. First operand 234 states and 290 transitions. Second operand has 27 states, 25 states have (on average 4.48) internal successors, (112), 25 states have internal predecessors, (112), 9 states have call successors, (17), 3 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) [2024-11-05 08:20:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:12,423 INFO L93 Difference]: Finished difference Result 606 states and 772 transitions. [2024-11-05 08:20:12,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-05 08:20:12,424 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 4.48) internal successors, (112), 25 states have internal predecessors, (112), 9 states have call successors, (17), 3 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) Word has length 84 [2024-11-05 08:20:12,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:12,426 INFO L225 Difference]: With dead ends: 606 [2024-11-05 08:20:12,427 INFO L226 Difference]: Without dead ends: 460 [2024-11-05 08:20:12,428 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=235, Invalid=1405, Unknown=0, NotChecked=0, Total=1640 [2024-11-05 08:20:12,428 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 222 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 1100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:12,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1148 Invalid, 1100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-05 08:20:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2024-11-05 08:20:12,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 394. [2024-11-05 08:20:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 305 states have (on average 1.2295081967213115) internal successors, (375), 315 states have internal predecessors, (375), 52 states have call successors, (52), 28 states have call predecessors, (52), 36 states have return successors, (70), 50 states have call predecessors, (70), 48 states have call successors, (70) [2024-11-05 08:20:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 497 transitions. [2024-11-05 08:20:12,525 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 497 transitions. Word has length 84 [2024-11-05 08:20:12,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:12,525 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 497 transitions. [2024-11-05 08:20:12,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 4.48) internal successors, (112), 25 states have internal predecessors, (112), 9 states have call successors, (17), 3 states have call predecessors, (17), 7 states have return successors, (16), 7 states have call predecessors, (16), 9 states have call successors, (16) [2024-11-05 08:20:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 497 transitions. [2024-11-05 08:20:12,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:20:12,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:12,528 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:20:12,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-05 08:20:12,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:12,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:12,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:12,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1956325238, now seen corresponding path program 1 times [2024-11-05 08:20:12,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:12,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [744978486] [2024-11-05 08:20:12,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:12,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:12,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:12,731 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:20:12,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-05 08:20:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:12,889 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:20:12,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:13,029 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 08:20:13,029 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:13,276 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-05 08:20:13,277 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:13,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [744978486] [2024-11-05 08:20:13,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [744978486] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:13,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:13,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2024-11-05 08:20:13,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858123399] [2024-11-05 08:20:13,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:13,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:20:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:13,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:20:13,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:20:13,278 INFO L87 Difference]: Start difference. First operand 394 states and 497 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 08:20:13,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:13,475 INFO L93 Difference]: Finished difference Result 847 states and 1099 transitions. [2024-11-05 08:20:13,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:20:13,476 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 84 [2024-11-05 08:20:13,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:13,478 INFO L225 Difference]: With dead ends: 847 [2024-11-05 08:20:13,478 INFO L226 Difference]: Without dead ends: 381 [2024-11-05 08:20:13,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:20:13,479 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:13,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 318 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:20:13,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-11-05 08:20:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2024-11-05 08:20:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 292 states have (on average 1.2123287671232876) internal successors, (354), 302 states have internal predecessors, (354), 52 states have call successors, (52), 28 states have call predecessors, (52), 36 states have return successors, (70), 50 states have call predecessors, (70), 48 states have call successors, (70) [2024-11-05 08:20:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 476 transitions. [2024-11-05 08:20:13,518 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 476 transitions. Word has length 84 [2024-11-05 08:20:13,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:13,518 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 476 transitions. [2024-11-05 08:20:13,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 08:20:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 476 transitions. [2024-11-05 08:20:13,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-05 08:20:13,519 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:13,519 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:20:13,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-05 08:20:13,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:13,723 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:13,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash 428580672, now seen corresponding path program 1 times [2024-11-05 08:20:13,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:13,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1444601277] [2024-11-05 08:20:13,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:13,724 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:13,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:13,727 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:20:13,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-05 08:20:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:13,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 08:20:13,917 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:14,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-05 08:20:14,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-05 08:20:14,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-05 08:20:14,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:20:14,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-05 08:20:15,381 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (or (and (not (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|)) (= .cse0 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|)) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0)))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64) .cse2) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|)) is different from true [2024-11-05 08:20:15,495 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (and (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64) .cse2) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|)))))) is different from true [2024-11-05 08:20:16,479 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (and (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64) .cse2) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|))) (let ((.cse4 (select .cse5 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|) (_ bv24 64) .cse4))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (_ BitVec 64))) (and (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|) (_ bv24 64))))))) is different from true [2024-11-05 08:20:16,628 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_aws_linked_list_is_valid_#in~list#1.offset| |c_aws_linked_list_is_valid_~list#1.offset|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (and (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64) .cse2) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|))) (let ((.cse4 (select .cse5 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|) (_ bv24 64) .cse4))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (_ BitVec 64))) (and (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|) (_ bv24 64)))))) (= |c_aws_linked_list_is_valid_#in~list#1.base| |c_aws_linked_list_is_valid_~list#1.base|)) is different from true [2024-11-05 08:20:17,267 WARN L873 $PredicateComparison]: unable to prove that (and (or |c_aws_linked_list_is_valid_#t~short299#1| (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd (_ bv24 64) |c_aws_linked_list_is_valid_#in~list#1.offset|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (and (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse2)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64) .cse2) .cse3)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|))) (let ((.cse4 (select .cse5 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse4)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse5 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|) (_ bv24 64) .cse4))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (_ BitVec 64))) (and (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|) (_ bv24 64))))))) is different from true [2024-11-05 08:20:18,173 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 7 not checked. [2024-11-05 08:20:18,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:19,050 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-05 08:20:19,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2024-11-05 08:20:19,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2024-11-05 08:20:19,092 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:20:19,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 93 [2024-11-05 08:20:19,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-05 08:20:19,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-05 08:20:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-05 08:20:19,572 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:19,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1444601277] [2024-11-05 08:20:19,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1444601277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:20:19,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:20:19,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-05 08:20:19,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706824552] [2024-11-05 08:20:19,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:20:19,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-05 08:20:19,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-05 08:20:19,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=250, Unknown=11, NotChecked=180, Total=506 [2024-11-05 08:20:19,574 INFO L87 Difference]: Start difference. First operand 381 states and 476 transitions. Second operand has 23 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 10 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-05 08:20:24,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:20:28,860 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd (_ bv24 64) |c_aws_linked_list_is_valid_#in~list#1.offset|))))) (and (or |c_aws_linked_list_is_valid_#t~short299#1| .cse0) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (and (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|))) (let ((.cse1 (select .cse2 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41| v_DerPreprocessor_1) .cse1 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_41|) (_ bv24 64) .cse1) .cse2)) (not (= (_ bv0 64) .cse1))))))) (or .cse0 (not (= (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_~list#1.base|) (bvadd (_ bv24 64) |c_aws_linked_list_is_valid_~list#1.offset|)) (_ bv0 64)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))) (let ((.cse3 (select .cse4 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse3)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64) .cse3) .cse4)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (_ BitVec 64))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|))) (let ((.cse5 (select .cse6 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse5)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse6 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse5 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|) (_ bv24 64) .cse5))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (_ BitVec 64))) (and (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_11|) (_ bv24 64)))))))) is different from true [2024-11-05 08:20:29,129 WARN L873 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (bvadd (_ bv24 64) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (and (not (= (_ bv0 64) .cse0)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64) .cse0) .cse1)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_40|))))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) (bvadd (_ bv24 64) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))))) is different from true [2024-11-05 08:20:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:30,498 INFO L93 Difference]: Finished difference Result 629 states and 778 transitions. [2024-11-05 08:20:30,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-05 08:20:30,499 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 10 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) Word has length 86 [2024-11-05 08:20:30,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:30,501 INFO L225 Difference]: With dead ends: 629 [2024-11-05 08:20:30,501 INFO L226 Difference]: Without dead ends: 490 [2024-11-05 08:20:30,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=115, Invalid=494, Unknown=19, NotChecked=364, Total=992 [2024-11-05 08:20:30,502 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 22 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 2 mSolverCounterUnsat, 37 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 37 IncrementalHoareTripleChecker+Unknown, 903 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:30,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1069 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 475 Invalid, 37 Unknown, 903 Unchecked, 9.3s Time] [2024-11-05 08:20:30,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2024-11-05 08:20:30,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 468. [2024-11-05 08:20:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 367 states have (on average 1.220708446866485) internal successors, (448), 377 states have internal predecessors, (448), 56 states have call successors, (56), 36 states have call predecessors, (56), 44 states have return successors, (73), 54 states have call predecessors, (73), 52 states have call successors, (73) [2024-11-05 08:20:30,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 577 transitions. [2024-11-05 08:20:30,594 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 577 transitions. Word has length 86 [2024-11-05 08:20:30,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:30,594 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 577 transitions. [2024-11-05 08:20:30,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 5.6) internal successors, (112), 20 states have internal predecessors, (112), 10 states have call successors, (17), 5 states have call predecessors, (17), 6 states have return successors, (16), 8 states have call predecessors, (16), 10 states have call successors, (16) [2024-11-05 08:20:30,595 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 577 transitions. [2024-11-05 08:20:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-05 08:20:30,597 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:30,597 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:20:30,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-05 08:20:30,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:30,800 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:30,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:30,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1312180862, now seen corresponding path program 1 times [2024-11-05 08:20:30,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:30,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2053404882] [2024-11-05 08:20:30,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:30,803 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:30,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:30,805 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:20:30,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-05 08:20:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:30,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:20:30,982 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 08:20:31,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:31,262 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-05 08:20:31,262 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:31,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2053404882] [2024-11-05 08:20:31,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2053404882] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:31,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:31,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-05 08:20:31,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154037214] [2024-11-05 08:20:31,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:31,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:20:31,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:31,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:20:31,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:20:31,264 INFO L87 Difference]: Start difference. First operand 468 states and 577 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 08:20:31,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:31,542 INFO L93 Difference]: Finished difference Result 761 states and 937 transitions. [2024-11-05 08:20:31,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:20:31,543 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 88 [2024-11-05 08:20:31,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:31,545 INFO L225 Difference]: With dead ends: 761 [2024-11-05 08:20:31,545 INFO L226 Difference]: Without dead ends: 480 [2024-11-05 08:20:31,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:20:31,547 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 21 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:31,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 374 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:20:31,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2024-11-05 08:20:31,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 456. [2024-11-05 08:20:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 359 states have (on average 1.2089136490250696) internal successors, (434), 365 states have internal predecessors, (434), 56 states have call successors, (56), 36 states have call predecessors, (56), 40 states have return successors, (67), 54 states have call predecessors, (67), 52 states have call successors, (67) [2024-11-05 08:20:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 557 transitions. [2024-11-05 08:20:31,630 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 557 transitions. Word has length 88 [2024-11-05 08:20:31,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:31,630 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 557 transitions. [2024-11-05 08:20:31,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-05 08:20:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 557 transitions. [2024-11-05 08:20:31,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-05 08:20:31,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:31,631 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:20:31,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2024-11-05 08:20:31,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:31,835 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:31,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:31,836 INFO L85 PathProgramCache]: Analyzing trace with hash -830584119, now seen corresponding path program 1 times [2024-11-05 08:20:31,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:31,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [709487672] [2024-11-05 08:20:31,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:31,836 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:31,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:31,839 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:20:31,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-05 08:20:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:32,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-05 08:20:32,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:32,549 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-05 08:20:32,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:33,058 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:20:33,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2024-11-05 08:20:33,142 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-05 08:20:33,142 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:33,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [709487672] [2024-11-05 08:20:33,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [709487672] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:20:33,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:20:33,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2024-11-05 08:20:33,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563418341] [2024-11-05 08:20:33,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:20:33,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 08:20:33,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:33,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 08:20:33,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-05 08:20:33,144 INFO L87 Difference]: Start difference. First operand 456 states and 557 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 12 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-05 08:20:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:35,657 INFO L93 Difference]: Finished difference Result 919 states and 1175 transitions. [2024-11-05 08:20:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-05 08:20:35,658 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 12 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 94 [2024-11-05 08:20:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:35,661 INFO L225 Difference]: With dead ends: 919 [2024-11-05 08:20:35,661 INFO L226 Difference]: Without dead ends: 604 [2024-11-05 08:20:35,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-11-05 08:20:35,662 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 19 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:35,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 721 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-05 08:20:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-11-05 08:20:35,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 488. [2024-11-05 08:20:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 383 states have (on average 1.2010443864229765) internal successors, (460), 393 states have internal predecessors, (460), 56 states have call successors, (56), 36 states have call predecessors, (56), 48 states have return successors, (83), 58 states have call predecessors, (83), 52 states have call successors, (83) [2024-11-05 08:20:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 599 transitions. [2024-11-05 08:20:35,718 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 599 transitions. Word has length 94 [2024-11-05 08:20:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:35,718 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 599 transitions. [2024-11-05 08:20:35,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 12 states have internal predecessors, (76), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2024-11-05 08:20:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 599 transitions. [2024-11-05 08:20:35,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-05 08:20:35,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:35,720 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:20:35,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-05 08:20:35,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:35,921 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:35,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:35,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1311664377, now seen corresponding path program 1 times [2024-11-05 08:20:35,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:35,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1630504535] [2024-11-05 08:20:35,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:35,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:35,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:35,924 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:20:35,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-05 08:20:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:36,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:20:36,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:36,125 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-05 08:20:36,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-05 08:20:36,219 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:36,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1630504535] [2024-11-05 08:20:36,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1630504535] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:36,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:36,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-05 08:20:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253107992] [2024-11-05 08:20:36,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:36,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:20:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:36,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:20:36,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:20:36,222 INFO L87 Difference]: Start difference. First operand 488 states and 599 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:20:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:36,344 INFO L93 Difference]: Finished difference Result 912 states and 1139 transitions. [2024-11-05 08:20:36,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:20:36,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2024-11-05 08:20:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:36,347 INFO L225 Difference]: With dead ends: 912 [2024-11-05 08:20:36,348 INFO L226 Difference]: Without dead ends: 478 [2024-11-05 08:20:36,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:20:36,350 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:36,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 317 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:20:36,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-11-05 08:20:36,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 440. [2024-11-05 08:20:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 345 states have (on average 1.1478260869565218) internal successors, (396), 351 states have internal predecessors, (396), 52 states have call successors, (52), 32 states have call predecessors, (52), 42 states have return successors, (67), 56 states have call predecessors, (67), 48 states have call successors, (67) [2024-11-05 08:20:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 515 transitions. [2024-11-05 08:20:36,400 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 515 transitions. Word has length 94 [2024-11-05 08:20:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:36,401 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 515 transitions. [2024-11-05 08:20:36,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-05 08:20:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 515 transitions. [2024-11-05 08:20:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-05 08:20:36,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:36,402 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 08:20:36,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-05 08:20:36,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:36,603 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:36,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:36,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1716037046, now seen corresponding path program 2 times [2024-11-05 08:20:36,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:36,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1607228054] [2024-11-05 08:20:36,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:36,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:20:36,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:36,606 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:20:36,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-05 08:20:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:36,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-05 08:20:36,775 INFO L278 TraceCheckSpWp]: Computing forward predicates...