/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_swap_contents_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:19:48,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:19:48,985 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:19:48,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:19:48,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:19:49,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:19:49,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:19:49,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:19:49,021 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:19:49,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:19:49,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:19:49,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:19:49,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:19:49,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:19:49,026 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:19:49,026 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:19:49,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:19:49,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:19:49,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:19:49,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:19:49,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:19:49,029 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:19:49,029 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:19:49,029 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:19:49,029 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:19:49,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:19:49,030 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:19:49,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:19:49,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:19:49,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:19:49,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:19:49,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:19:49,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:19:49,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:19:49,033 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:19:49,033 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:19:49,033 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:19:49,033 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:19:49,034 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:19:49,034 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:19:49,034 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:19:49,034 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:19:49,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:19:49,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:19:49,284 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:19:49,285 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:19:49,285 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:19:49,286 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_swap_contents_harness.i [2024-11-05 08:19:50,696 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:19:51,057 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:19:51,058 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_swap_contents_harness.i [2024-11-05 08:19:51,090 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9bd433d/942ca3c678664ff19fd6c939770da84a/FLAG9e58a3e4a [2024-11-05 08:19:51,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b9bd433d/942ca3c678664ff19fd6c939770da84a [2024-11-05 08:19:51,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:19:51,107 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:19:51,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:19:51,108 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:19:51,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:19:51,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:19:51" (1/1) ... [2024-11-05 08:19:51,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10ce378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:51, skipping insertion in model container [2024-11-05 08:19:51,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:19:51" (1/1) ... [2024-11-05 08:19:51,198 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:19:51,445 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_swap_contents_harness.i[4503,4516] [2024-11-05 08:19:51,452 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_swap_contents_harness.i[4563,4576] [2024-11-05 08:19:51,939 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:19:52,019 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:19:52,020 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:19:52,021 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:19:52,035 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:19:52,041 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,042 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,042 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,043 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:19:52,043 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,046 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,051 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:19:52,051 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:19:52,053 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:19:52,053 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:19:52,066 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,067 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:19:52,070 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,070 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:19:52,071 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,072 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:19:52,072 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,072 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:19:52,076 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,078 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:19:52,078 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,078 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:19:52,079 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,079 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,360 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:19:52,361 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:19:52,365 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:19:52,366 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:19:52,523 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:19:52,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:19:52,571 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 08:19:52,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:19:52,599 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_swap_contents_harness.i[4503,4516] [2024-11-05 08:19:52,599 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_swap_contents_harness.i[4563,4576] [2024-11-05 08:19:52,616 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:19:52,629 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:19:52,630 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:19:52,630 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:19:52,634 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:19:52,634 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,635 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,635 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,636 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:19:52,636 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,637 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,638 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:19:52,638 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:19:52,639 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:19:52,639 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:19:52,643 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,643 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:19:52,643 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,643 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:19:52,644 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,644 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:19:52,644 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,645 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:19:52,645 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,646 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:19:52,646 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,646 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:19:52,646 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,647 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,685 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:19:52,685 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:19:52,686 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:19:52,686 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:19:52,715 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:19:52,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:19:52,731 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:19:52,742 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_swap_contents_harness.i[4503,4516] [2024-11-05 08:19:52,743 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_swap_contents_harness.i[4563,4576] [2024-11-05 08:19:52,780 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,780 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,781 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,781 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,781 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,786 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,787 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,789 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,790 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,791 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,791 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,791 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,791 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:19:52,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:19:53,081 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 08:19:53,093 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:19:53,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53 WrapperNode [2024-11-05 08:19:53,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:19:53,096 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:19:53,096 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:19:53,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:19:53,102 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:19:53" (1/1) ... [2024-11-05 08:19:53,181 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:19:53" (1/1) ... [2024-11-05 08:19:53,234 INFO L138 Inliner]: procedures = 687, calls = 1078, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 214 [2024-11-05 08:19:53,235 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:19:53,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:19:53,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:19:53,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:19:53,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (1/1) ... [2024-11-05 08:19:53,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (1/1) ... [2024-11-05 08:19:53,257 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (1/1) ... [2024-11-05 08:19:53,295 INFO L175 MemorySlicer]: Split 68 memory accesses to 5 slices as follows [2, 7, 5, 47, 7]. 69 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 4, 5, 0, 4]. The 18 writes are split as follows [0, 0, 0, 18, 0]. [2024-11-05 08:19:53,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (1/1) ... [2024-11-05 08:19:53,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (1/1) ... [2024-11-05 08:19:53,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (1/1) ... [2024-11-05 08:19:53,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (1/1) ... [2024-11-05 08:19:53,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (1/1) ... [2024-11-05 08:19:53,344 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (1/1) ... [2024-11-05 08:19:53,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:19:53,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:19:53,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:19:53,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:19:53,358 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (1/1) ... [2024-11-05 08:19:53,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:19:53,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:19:53,385 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:53,387 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:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2024-11-05 08:19:53,407 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2024-11-05 08:19:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:19:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:19:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:19:53,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:19:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-05 08:19:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-05 08:19:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 08:19:53,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 08:19:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:19:53,408 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:19:53,408 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_linked_list_is_allocated [2024-11-05 08:19:53,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_linked_list_is_allocated [2024-11-05 08:19:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-05 08:19:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-05 08:19:53,409 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-05 08:19:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:19:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 08:19:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 08:19:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 08:19:53,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-05 08:19:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-05 08:19:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:19:53,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:19:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-05 08:19:53,410 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-05 08:19:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:19:53,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:19:53,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:19:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 08:19:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 08:19:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 08:19:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-05 08:19:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-05 08:19:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 08:19:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 08:19:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 08:19:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-05 08:19:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-05 08:19:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-05 08:19:53,412 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-05 08:19:53,690 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:19:53,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:19:54,907 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2024-11-05 08:19:54,907 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:19:54,924 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:19:54,924 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 08:19:54,925 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:19:54 BoogieIcfgContainer [2024-11-05 08:19:54,925 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:19:54,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:19:54,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:19:54,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:19:54,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:19:51" (1/3) ... [2024-11-05 08:19:54,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7143edfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:19:54, skipping insertion in model container [2024-11-05 08:19:54,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:19:53" (2/3) ... [2024-11-05 08:19:54,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7143edfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:19:54, skipping insertion in model container [2024-11-05 08:19:54,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:19:54" (3/3) ... [2024-11-05 08:19:54,933 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_swap_contents_harness.i [2024-11-05 08:19:54,948 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:19:54,949 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:19:55,003 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:19:55,009 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;@76b89c75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:19:55,010 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:19:55,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 70 states have (on average 1.3) internal successors, (91), 73 states have internal predecessors, (91), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-05 08:19:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-05 08:19:55,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:55,025 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-05 08:19:55,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:55,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:55,030 INFO L85 PathProgramCache]: Analyzing trace with hash 408503669, now seen corresponding path program 1 times [2024-11-05 08:19:55,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:55,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [537531050] [2024-11-05 08:19:55,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:55,037 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:55,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:55,039 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:55,041 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:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:55,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:19:55,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:55,469 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-05 08:19:55,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-11-05 08:19:55,601 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:55,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [537531050] [2024-11-05 08:19:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [537531050] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:19:55,602 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:19:55,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 08:19:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243105309] [2024-11-05 08:19:55,605 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:55,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:19:55,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:55,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:19:55,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:19:55,636 INFO L87 Difference]: Start difference. First operand has 114 states, 70 states have (on average 1.3) internal successors, (91), 73 states have internal predecessors, (91), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 08:19:55,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:55,683 INFO L93 Difference]: Finished difference Result 225 states and 346 transitions. [2024-11-05 08:19:55,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:19:55,687 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2024-11-05 08:19:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:55,697 INFO L225 Difference]: With dead ends: 225 [2024-11-05 08:19:55,697 INFO L226 Difference]: Without dead ends: 107 [2024-11-05 08:19:55,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 200 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:55,703 INFO L432 NwaCegarLoop]: 155 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, 155 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:55,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 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:55,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-05 08:19:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-05 08:19:55,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.265625) internal successors, (81), 68 states have internal predecessors, (81), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-05 08:19:55,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2024-11-05 08:19:55,746 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 101 [2024-11-05 08:19:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:55,747 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 147 transitions. [2024-11-05 08:19:55,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 08:19:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2024-11-05 08:19:55,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-05 08:19:55,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:55,752 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-05 08:19:55,766 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:55,957 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:55,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:55,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:55,959 INFO L85 PathProgramCache]: Analyzing trace with hash 34190191, now seen corresponding path program 1 times [2024-11-05 08:19:55,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:55,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1876672367] [2024-11-05 08:19:55,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:55,960 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:55,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:55,962 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:55,978 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:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:56,343 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:19:56,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:56,472 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-05 08:19:56,473 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:56,686 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-05 08:19:56,686 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:56,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1876672367] [2024-11-05 08:19:56,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1876672367] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:56,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:56,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2024-11-05 08:19:56,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128378867] [2024-11-05 08:19:56,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:56,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:19:56,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:56,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:19:56,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:19:56,689 INFO L87 Difference]: Start difference. First operand 107 states and 147 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:19:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:58,077 INFO L93 Difference]: Finished difference Result 211 states and 302 transitions. [2024-11-05 08:19:58,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:58,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2024-11-05 08:19:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:58,082 INFO L225 Difference]: With dead ends: 211 [2024-11-05 08:19:58,082 INFO L226 Difference]: Without dead ends: 123 [2024-11-05 08:19:58,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:58,084 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 42 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:58,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 603 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-05 08:19:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-05 08:19:58,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-11-05 08:19:58,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.3205128205128205) internal successors, (103), 83 states have internal predecessors, (103), 35 states have call successors, (35), 8 states have call predecessors, (35), 9 states have return successors, (37), 33 states have call predecessors, (37), 33 states have call successors, (37) [2024-11-05 08:19:58,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2024-11-05 08:19:58,108 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 101 [2024-11-05 08:19:58,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:58,108 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2024-11-05 08:19:58,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:19:58,109 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2024-11-05 08:19:58,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-05 08:19:58,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:58,113 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-05 08:19:58,129 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:58,313 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:58,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:58,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash 366035187, now seen corresponding path program 1 times [2024-11-05 08:19:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1098288109] [2024-11-05 08:19:58,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:58,315 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:58,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:58,318 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:58,319 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:58,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:58,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:19:58,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-05 08:19:58,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:58,875 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-05 08:19:58,876 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:58,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1098288109] [2024-11-05 08:19:58,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1098288109] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:58,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:58,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-05 08:19:58,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078431075] [2024-11-05 08:19:58,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:58,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:19:58,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:58,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:19:58,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:19:58,881 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-05 08:19:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:58,989 INFO L93 Difference]: Finished difference Result 231 states and 340 transitions. [2024-11-05 08:19:58,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:19:58,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 101 [2024-11-05 08:19:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:58,994 INFO L225 Difference]: With dead ends: 231 [2024-11-05 08:19:58,994 INFO L226 Difference]: Without dead ends: 127 [2024-11-05 08:19:58,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 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:58,998 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:58,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 687 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:19:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-05 08:19:59,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2024-11-05 08:19:59,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 85 states have internal predecessors, (104), 35 states have call successors, (35), 8 states have call predecessors, (35), 10 states have return successors, (43), 33 states have call predecessors, (43), 33 states have call successors, (43) [2024-11-05 08:19:59,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2024-11-05 08:19:59,023 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 101 [2024-11-05 08:19:59,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:59,023 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2024-11-05 08:19:59,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-05 08:19:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2024-11-05 08:19:59,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-05 08:19:59,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:59,029 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-11-05 08:19:59,046 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:59,230 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:59,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:59,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:59,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1474583313, now seen corresponding path program 1 times [2024-11-05 08:19:59,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:59,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1874440489] [2024-11-05 08:19:59,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:59,231 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:59,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:59,234 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:59,235 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:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:59,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:19:59,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:59,718 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-05 08:19:59,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:59,944 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-05 08:19:59,945 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:59,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1874440489] [2024-11-05 08:19:59,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1874440489] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:59,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:59,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-05 08:19:59,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118202046] [2024-11-05 08:19:59,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:59,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:19:59,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:59,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:19:59,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:19:59,947 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:20:02,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:02,409 INFO L93 Difference]: Finished difference Result 243 states and 365 transitions. [2024-11-05 08:20:02,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:20:02,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 103 [2024-11-05 08:20:02,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:02,413 INFO L225 Difference]: With dead ends: 243 [2024-11-05 08:20:02,413 INFO L226 Difference]: Without dead ends: 137 [2024-11-05 08:20:02,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 197 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:02,415 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 41 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:02,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 673 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-05 08:20:02,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-05 08:20:02,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 125. [2024-11-05 08:20:02,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 85 states have internal predecessors, (104), 35 states have call successors, (35), 8 states have call predecessors, (35), 10 states have return successors, (43), 33 states have call predecessors, (43), 33 states have call successors, (43) [2024-11-05 08:20:02,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 182 transitions. [2024-11-05 08:20:02,437 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 182 transitions. Word has length 103 [2024-11-05 08:20:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:02,437 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 182 transitions. [2024-11-05 08:20:02,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.333333333333334) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:20:02,437 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 182 transitions. [2024-11-05 08:20:02,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-05 08:20:02,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:02,439 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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] [2024-11-05 08:20:02,452 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:20:02,643 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:20:02,644 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:02,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:02,644 INFO L85 PathProgramCache]: Analyzing trace with hash -213907492, now seen corresponding path program 1 times [2024-11-05 08:20:02,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:02,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [682516736] [2024-11-05 08:20:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:02,645 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:02,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:02,646 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:20:02,646 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:20:03,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:03,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:20:03,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-05 08:20:03,145 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:03,386 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-05 08:20:03,386 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:03,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [682516736] [2024-11-05 08:20:03,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [682516736] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:03,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:03,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2024-11-05 08:20:03,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467362054] [2024-11-05 08:20:03,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:03,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:20:03,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:03,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:20:03,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-05 08:20:03,388 INFO L87 Difference]: Start difference. First operand 125 states and 182 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:20:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:05,828 INFO L93 Difference]: Finished difference Result 256 states and 386 transitions. [2024-11-05 08:20:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 08:20:05,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 105 [2024-11-05 08:20:05,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:05,831 INFO L225 Difference]: With dead ends: 256 [2024-11-05 08:20:05,832 INFO L226 Difference]: Without dead ends: 150 [2024-11-05 08:20:05,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-05 08:20:05,837 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 50 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:05,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 778 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-05 08:20:05,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-05 08:20:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 126. [2024-11-05 08:20:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.325) internal successors, (106), 86 states have internal predecessors, (106), 35 states have call successors, (35), 8 states have call predecessors, (35), 10 states have return successors, (43), 33 states have call predecessors, (43), 33 states have call successors, (43) [2024-11-05 08:20:05,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2024-11-05 08:20:05,863 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 105 [2024-11-05 08:20:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:05,863 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2024-11-05 08:20:05,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:20:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2024-11-05 08:20:05,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-05 08:20:05,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:05,865 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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:05,885 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 (6)] Ended with exit code 0 [2024-11-05 08:20:06,065 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:20:06,066 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:06,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:06,067 INFO L85 PathProgramCache]: Analyzing trace with hash -34711486, now seen corresponding path program 1 times [2024-11-05 08:20:06,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:06,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [89849688] [2024-11-05 08:20:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:06,067 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:06,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:06,069 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:20:06,070 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:20:06,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:06,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:20:06,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-05 08:20:06,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-05 08:20:06,607 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:06,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [89849688] [2024-11-05 08:20:06,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [89849688] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:06,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:06,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3] total 8 [2024-11-05 08:20:06,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343053470] [2024-11-05 08:20:06,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:06,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:20:06,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:06,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:20:06,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:20:06,609 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:20:07,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:07,508 INFO L93 Difference]: Finished difference Result 254 states and 392 transitions. [2024-11-05 08:20:07,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:20:07,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 106 [2024-11-05 08:20:07,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:07,511 INFO L225 Difference]: With dead ends: 254 [2024-11-05 08:20:07,511 INFO L226 Difference]: Without dead ends: 147 [2024-11-05 08:20:07,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:20:07,512 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 44 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:07,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 554 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 08:20:07,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-05 08:20:07,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2024-11-05 08:20:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.3253012048192772) internal successors, (110), 89 states have internal predecessors, (110), 35 states have call successors, (35), 8 states have call predecessors, (35), 10 states have return successors, (43), 33 states have call predecessors, (43), 33 states have call successors, (43) [2024-11-05 08:20:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 188 transitions. [2024-11-05 08:20:07,525 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 188 transitions. Word has length 106 [2024-11-05 08:20:07,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:07,526 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 188 transitions. [2024-11-05 08:20:07,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.666666666666666) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:20:07,526 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 188 transitions. [2024-11-05 08:20:07,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-05 08:20:07,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:07,527 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:07,542 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:20:07,729 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:20:07,730 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:07,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 278892130, now seen corresponding path program 1 times [2024-11-05 08:20:07,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:07,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [706894804] [2024-11-05 08:20:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:07,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:07,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:07,732 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:20:07,732 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:20:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:08,059 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 08:20:08,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:08,225 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-05 08:20:08,225 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-05 08:20:08,616 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:08,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [706894804] [2024-11-05 08:20:08,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [706894804] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:08,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:08,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 13 [2024-11-05 08:20:08,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265300799] [2024-11-05 08:20:08,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:08,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 08:20:08,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:08,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 08:20:08,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-05 08:20:08,618 INFO L87 Difference]: Start difference. First operand 129 states and 188 transitions. Second operand has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-05 08:20:14,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:14,624 INFO L93 Difference]: Finished difference Result 280 states and 426 transitions. [2024-11-05 08:20:14,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-05 08:20:14,625 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 114 [2024-11-05 08:20:14,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:14,627 INFO L225 Difference]: With dead ends: 280 [2024-11-05 08:20:14,627 INFO L226 Difference]: Without dead ends: 170 [2024-11-05 08:20:14,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-05 08:20:14,628 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 63 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:14,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 1017 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2024-11-05 08:20:14,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-05 08:20:14,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 135. [2024-11-05 08:20:14,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 87 states have (on average 1.3218390804597702) internal successors, (115), 95 states have internal predecessors, (115), 36 states have call successors, (36), 8 states have call predecessors, (36), 11 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2024-11-05 08:20:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 198 transitions. [2024-11-05 08:20:14,646 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 198 transitions. Word has length 114 [2024-11-05 08:20:14,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:14,646 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 198 transitions. [2024-11-05 08:20:14,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.555555555555555) internal successors, (59), 10 states have internal predecessors, (59), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2024-11-05 08:20:14,646 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 198 transitions. [2024-11-05 08:20:14,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-05 08:20:14,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:14,648 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:14,664 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:20:14,848 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:20:14,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:14,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:14,849 INFO L85 PathProgramCache]: Analyzing trace with hash -400380124, now seen corresponding path program 1 times [2024-11-05 08:20:14,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:14,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425972449] [2024-11-05 08:20:14,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:14,850 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:14,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:14,851 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:20:14,852 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:20:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:15,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:20:15,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-05 08:20:15,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:15,382 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-05 08:20:15,382 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:15,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425972449] [2024-11-05 08:20:15,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [425972449] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:15,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:15,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-05 08:20:15,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032175937] [2024-11-05 08:20:15,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:15,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:20:15,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:15,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:20:15,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:20:15,384 INFO L87 Difference]: Start difference. First operand 135 states and 198 transitions. Second operand has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-05 08:20:15,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:15,477 INFO L93 Difference]: Finished difference Result 257 states and 388 transitions. [2024-11-05 08:20:15,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:20:15,478 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2024-11-05 08:20:15,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:15,480 INFO L225 Difference]: With dead ends: 257 [2024-11-05 08:20:15,480 INFO L226 Difference]: Without dead ends: 141 [2024-11-05 08:20:15,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 220 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:20:15,484 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:15,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 819 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:20:15,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-05 08:20:15,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 136. [2024-11-05 08:20:15,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 88 states have (on average 1.3181818181818181) internal successors, (116), 96 states have internal predecessors, (116), 36 states have call successors, (36), 8 states have call predecessors, (36), 11 states have return successors, (47), 33 states have call predecessors, (47), 34 states have call successors, (47) [2024-11-05 08:20:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-11-05 08:20:15,503 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 114 [2024-11-05 08:20:15,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:15,504 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-11-05 08:20:15,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-05 08:20:15,504 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-11-05 08:20:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-05 08:20:15,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:15,506 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:15,520 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 (9)] Forceful destruction successful, exit code 0 [2024-11-05 08:20:15,706 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:20:15,706 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:15,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:15,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1303206097, now seen corresponding path program 1 times [2024-11-05 08:20:15,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:15,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [872917359] [2024-11-05 08:20:15,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:15,707 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:15,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:15,709 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:20:15,710 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:20:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:16,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-05 08:20:16,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:20,519 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_3| (_ 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$#3.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3| (_ 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$#3.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3|) |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:20:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 42 proven. 1 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-05 08:20:20,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-05 08:20:21,104 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:21,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [872917359] [2024-11-05 08:20:21,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [872917359] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:20:21,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:20:21,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-05 08:20:21,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062591647] [2024-11-05 08:20:21,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:20:21,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:20:21,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:21,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:20:21,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2024-11-05 08:20:21,106 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-05 08:20:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:25,788 INFO L93 Difference]: Finished difference Result 315 states and 505 transitions. [2024-11-05 08:20:25,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 08:20:25,790 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 116 [2024-11-05 08:20:25,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:25,792 INFO L225 Difference]: With dead ends: 315 [2024-11-05 08:20:25,792 INFO L226 Difference]: Without dead ends: 198 [2024-11-05 08:20:25,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=74, Invalid=309, Unknown=1, NotChecked=36, Total=420 [2024-11-05 08:20:25,793 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 45 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 320 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:25,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1167 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 454 Invalid, 0 Unknown, 320 Unchecked, 4.4s Time] [2024-11-05 08:20:25,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-05 08:20:25,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 165. [2024-11-05 08:20:25,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 114 states have (on average 1.3333333333333333) internal successors, (152), 122 states have internal predecessors, (152), 38 states have call successors, (38), 9 states have call predecessors, (38), 12 states have return successors, (53), 35 states have call predecessors, (53), 36 states have call successors, (53) [2024-11-05 08:20:25,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 243 transitions. [2024-11-05 08:20:25,809 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 243 transitions. Word has length 116 [2024-11-05 08:20:25,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:25,810 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 243 transitions. [2024-11-05 08:20:25,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.8125) internal successors, (93), 16 states have internal predecessors, (93), 4 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-05 08:20:25,810 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 243 transitions. [2024-11-05 08:20:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-05 08:20:25,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:25,812 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:25,838 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:20:26,012 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:20:26,013 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:26,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:26,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1257656749, now seen corresponding path program 1 times [2024-11-05 08:20:26,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:26,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [654371340] [2024-11-05 08:20:26,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:26,013 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:26,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:26,014 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:20:26,016 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:20:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:26,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 08:20:26,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2024-11-05 08:20:26,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:26,459 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-05 08:20:26,459 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:26,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [654371340] [2024-11-05 08:20:26,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [654371340] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:26,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:26,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-05 08:20:26,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926031744] [2024-11-05 08:20:26,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:26,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:20:26,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:26,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:20:26,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:20:26,461 INFO L87 Difference]: Start difference. First operand 165 states and 243 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 08:20:26,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:26,491 INFO L93 Difference]: Finished difference Result 313 states and 484 transitions. [2024-11-05 08:20:26,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:20:26,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-11-05 08:20:26,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:26,494 INFO L225 Difference]: With dead ends: 313 [2024-11-05 08:20:26,494 INFO L226 Difference]: Without dead ends: 167 [2024-11-05 08:20:26,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 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:20:26,496 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 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:20:26,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:20:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-11-05 08:20:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2024-11-05 08:20:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 122 states have internal predecessors, (150), 38 states have call successors, (38), 9 states have call predecessors, (38), 12 states have return successors, (53), 35 states have call predecessors, (53), 36 states have call successors, (53) [2024-11-05 08:20:26,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 241 transitions. [2024-11-05 08:20:26,509 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 241 transitions. Word has length 116 [2024-11-05 08:20:26,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:26,509 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 241 transitions. [2024-11-05 08:20:26,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 08:20:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 241 transitions. [2024-11-05 08:20:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-05 08:20:26,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:26,511 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:26,525 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 (11)] Ended with exit code 0 [2024-11-05 08:20:26,711 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:20:26,712 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:26,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:26,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1126267989, now seen corresponding path program 1 times [2024-11-05 08:20:26,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:26,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1061428227] [2024-11-05 08:20:26,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:26,712 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:26,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:26,713 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:20:26,714 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:20:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:27,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:20:27,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-05 08:20:27,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:27,136 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-05 08:20:27,136 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:27,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1061428227] [2024-11-05 08:20:27,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1061428227] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:27,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:27,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-05 08:20:27,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682871932] [2024-11-05 08:20:27,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:27,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:20:27,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:27,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:20:27,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:20:27,138 INFO L87 Difference]: Start difference. First operand 165 states and 241 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 08:20:27,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:27,183 INFO L93 Difference]: Finished difference Result 310 states and 477 transitions. [2024-11-05 08:20:27,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:20:27,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2024-11-05 08:20:27,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:27,186 INFO L225 Difference]: With dead ends: 310 [2024-11-05 08:20:27,186 INFO L226 Difference]: Without dead ends: 164 [2024-11-05 08:20:27,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 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:27,188 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 571 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:20:27,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 571 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:20:27,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-05 08:20:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2024-11-05 08:20:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 115 states have internal predecessors, (138), 37 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (51), 35 states have call predecessors, (51), 35 states have call successors, (51) [2024-11-05 08:20:27,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 226 transitions. [2024-11-05 08:20:27,231 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 226 transitions. Word has length 116 [2024-11-05 08:20:27,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:27,232 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 226 transitions. [2024-11-05 08:20:27,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 08:20:27,232 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 226 transitions. [2024-11-05 08:20:27,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-05 08:20:27,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:27,233 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:27,248 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 (12)] Ended with exit code 0 [2024-11-05 08:20:27,434 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:20:27,434 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:27,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash -248830483, now seen corresponding path program 1 times [2024-11-05 08:20:27,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:27,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2015011504] [2024-11-05 08:20:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:27,435 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:27,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:27,436 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:20:27,437 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:20:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:27,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:20:27,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:27,834 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 08:20:27,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:27,955 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-05 08:20:27,955 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:27,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2015011504] [2024-11-05 08:20:27,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2015011504] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:27,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:27,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2024-11-05 08:20:27,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608705580] [2024-11-05 08:20:27,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:27,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:20:27,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:27,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:20:27,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:20:27,957 INFO L87 Difference]: Start difference. First operand 158 states and 226 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-05 08:20:29,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:29,115 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2024-11-05 08:20:29,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:20:29,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 117 [2024-11-05 08:20:29,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:29,117 INFO L225 Difference]: With dead ends: 304 [2024-11-05 08:20:29,117 INFO L226 Difference]: Without dead ends: 168 [2024-11-05 08:20:29,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:20:29,119 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 41 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:29,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 622 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-05 08:20:29,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-05 08:20:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2024-11-05 08:20:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 116 states have (on average 1.293103448275862) internal successors, (150), 123 states have internal predecessors, (150), 38 states have call successors, (38), 9 states have call predecessors, (38), 13 states have return successors, (54), 37 states have call predecessors, (54), 36 states have call successors, (54) [2024-11-05 08:20:29,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 242 transitions. [2024-11-05 08:20:29,133 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 242 transitions. Word has length 117 [2024-11-05 08:20:29,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:29,134 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 242 transitions. [2024-11-05 08:20:29,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-05 08:20:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 242 transitions. [2024-11-05 08:20:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-05 08:20:29,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:29,135 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:29,151 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:29,336 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:29,336 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:29,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1800557359, now seen corresponding path program 1 times [2024-11-05 08:20:29,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:29,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [65525410] [2024-11-05 08:20:29,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:29,337 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:29,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:29,338 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:29,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 (14)] Waiting until timeout for monitored process [2024-11-05 08:20:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:29,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:20:29,719 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:29,756 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-05 08:20:29,757 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:29,846 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-05 08:20:29,846 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:29,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [65525410] [2024-11-05 08:20:29,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [65525410] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:29,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:29,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-05 08:20:29,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312713833] [2024-11-05 08:20:29,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:29,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:20:29,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:29,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:20:29,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:20:29,848 INFO L87 Difference]: Start difference. First operand 168 states and 242 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-05 08:20:29,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:29,938 INFO L93 Difference]: Finished difference Result 318 states and 463 transitions. [2024-11-05 08:20:29,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:20:29,938 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2024-11-05 08:20:29,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:29,939 INFO L225 Difference]: With dead ends: 318 [2024-11-05 08:20:29,940 INFO L226 Difference]: Without dead ends: 172 [2024-11-05 08:20:29,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 227 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:20:29,941 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:29,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 687 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:20:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-05 08:20:29,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2024-11-05 08:20:29,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 117 states have (on average 1.2905982905982907) internal successors, (151), 125 states have internal predecessors, (151), 38 states have call successors, (38), 9 states have call predecessors, (38), 14 states have return successors, (59), 37 states have call predecessors, (59), 36 states have call successors, (59) [2024-11-05 08:20:29,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 248 transitions. [2024-11-05 08:20:29,955 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 248 transitions. Word has length 117 [2024-11-05 08:20:29,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:29,956 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 248 transitions. [2024-11-05 08:20:29,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-05 08:20:29,956 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 248 transitions. [2024-11-05 08:20:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-05 08:20:29,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:29,957 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:20:29,971 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 (14)] Ended with exit code 0 [2024-11-05 08:20:30,158 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:30,158 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:30,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:30,158 INFO L85 PathProgramCache]: Analyzing trace with hash 407057643, now seen corresponding path program 1 times [2024-11-05 08:20:30,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:30,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [198261871] [2024-11-05 08:20:30,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:30,159 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,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:30,162 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:30,163 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:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:30,522 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:20:30,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-05 08:20:30,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-05 08:20:30,749 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:30,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [198261871] [2024-11-05 08:20:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [198261871] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:30,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:30,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-05 08:20:30,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076445552] [2024-11-05 08:20:30,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:30,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:20:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:30,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:20:30,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:20:30,751 INFO L87 Difference]: Start difference. First operand 170 states and 248 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-05 08:20:31,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:31,682 INFO L93 Difference]: Finished difference Result 332 states and 483 transitions. [2024-11-05 08:20:31,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:20:31,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 119 [2024-11-05 08:20:31,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:31,685 INFO L225 Difference]: With dead ends: 332 [2024-11-05 08:20:31,685 INFO L226 Difference]: Without dead ends: 184 [2024-11-05 08:20:31,686 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 229 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,688 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 40 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:31,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 690 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 08:20:31,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-05 08:20:31,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 170. [2024-11-05 08:20:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 117 states have (on average 1.2905982905982907) internal successors, (151), 125 states have internal predecessors, (151), 38 states have call successors, (38), 9 states have call predecessors, (38), 14 states have return successors, (59), 37 states have call predecessors, (59), 36 states have call successors, (59) [2024-11-05 08:20:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 248 transitions. [2024-11-05 08:20:31,706 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 248 transitions. Word has length 119 [2024-11-05 08:20:31,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:31,707 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 248 transitions. [2024-11-05 08:20:31,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-05 08:20:31,708 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 248 transitions. [2024-11-05 08:20:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-05 08:20:31,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:31,709 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2024-11-05 08:20:31,723 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:31,909 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:31,910 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:31,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:31,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1442199660, now seen corresponding path program 1 times [2024-11-05 08:20:31,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:31,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1627513139] [2024-11-05 08:20:31,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:31,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:20:31,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:31,911 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:31,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 (16)] Waiting until timeout for monitored process [2024-11-05 08:20:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:32,312 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 08:20:32,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-05 08:20:32,425 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:32,676 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-05 08:20:32,676 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:32,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1627513139] [2024-11-05 08:20:32,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1627513139] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:32,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:32,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 13 [2024-11-05 08:20:32,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894246037] [2024-11-05 08:20:32,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:32,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 08:20:32,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:32,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 08:20:32,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-05 08:20:32,678 INFO L87 Difference]: Start difference. First operand 170 states and 248 transitions. Second operand has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-05 08:20:35,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:35,897 INFO L93 Difference]: Finished difference Result 344 states and 500 transitions. [2024-11-05 08:20:35,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-05 08:20:35,898 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 130 [2024-11-05 08:20:35,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:35,900 INFO L225 Difference]: With dead ends: 344 [2024-11-05 08:20:35,900 INFO L226 Difference]: Without dead ends: 196 [2024-11-05 08:20:35,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-05 08:20:35,901 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 59 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 930 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:35,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 930 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-05 08:20:35,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-05 08:20:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2024-11-05 08:20:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 109 states have (on average 1.275229357798165) internal successors, (139), 117 states have internal predecessors, (139), 37 states have call successors, (37), 9 states have call predecessors, (37), 13 states have return successors, (53), 35 states have call predecessors, (53), 35 states have call successors, (53) [2024-11-05 08:20:35,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 229 transitions. [2024-11-05 08:20:35,915 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 229 transitions. Word has length 130 [2024-11-05 08:20:35,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:35,915 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 229 transitions. [2024-11-05 08:20:35,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.1) internal successors, (81), 10 states have internal predecessors, (81), 5 states have call successors, (14), 2 states have call predecessors, (14), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-05 08:20:35,915 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 229 transitions. [2024-11-05 08:20:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-05 08:20:35,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:35,916 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:35,932 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 (16)] Forceful destruction successful, exit code 0 [2024-11-05 08:20:36,117 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:36,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:36,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:36,117 INFO L85 PathProgramCache]: Analyzing trace with hash 607188182, now seen corresponding path program 1 times [2024-11-05 08:20:36,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:36,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1599057261] [2024-11-05 08:20:36,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:36,118 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,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:36,119 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:36,120 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:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:36,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:20:36,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:36,545 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-11-05 08:20:36,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-05 08:20:36,662 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:36,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1599057261] [2024-11-05 08:20:36,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1599057261] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:36,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:36,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-05 08:20:36,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654831798] [2024-11-05 08:20:36,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:36,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:20:36,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:36,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:20:36,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:20:36,663 INFO L87 Difference]: Start difference. First operand 160 states and 229 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-05 08:20:36,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:36,729 INFO L93 Difference]: Finished difference Result 301 states and 432 transitions. [2024-11-05 08:20:36,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:20:36,730 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 130 [2024-11-05 08:20:36,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:36,731 INFO L225 Difference]: With dead ends: 301 [2024-11-05 08:20:36,731 INFO L226 Difference]: Without dead ends: 163 [2024-11-05 08:20:36,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 252 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:20:36,732 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:36,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 819 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:20:36,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-05 08:20:36,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 158. [2024-11-05 08:20:36,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 108 states have (on average 1.2777777777777777) internal successors, (138), 115 states have internal predecessors, (138), 37 states have call successors, (37), 9 states have call predecessors, (37), 12 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2024-11-05 08:20:36,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 222 transitions. [2024-11-05 08:20:36,745 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 222 transitions. Word has length 130 [2024-11-05 08:20:36,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:36,745 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 222 transitions. [2024-11-05 08:20:36,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-05 08:20:36,745 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 222 transitions. [2024-11-05 08:20:36,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-05 08:20:36,746 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:36,746 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-05 08:20:36,763 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:36,950 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:36,950 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:36,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:36,951 INFO L85 PathProgramCache]: Analyzing trace with hash -883566423, now seen corresponding path program 2 times [2024-11-05 08:20:36,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:36,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1489055191] [2024-11-05 08:20:36,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:36,951 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,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:36,952 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:36,953 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:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:37,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-05 08:20:37,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 69 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-05 08:20:38,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:38,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:20:38,709 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 26 treesize of output 29 [2024-11-05 08:20:38,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:20:38,729 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 27 [2024-11-05 08:20:38,903 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-05 08:20:38,903 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:38,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1489055191] [2024-11-05 08:20:38,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1489055191] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:20:38,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:20:38,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-05 08:20:38,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288247439] [2024-11-05 08:20:38,904 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:20:38,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 08:20:38,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:38,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 08:20:38,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:20:38,906 INFO L87 Difference]: Start difference. First operand 158 states and 222 transitions. Second operand has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 17 states have internal predecessors, (90), 9 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 11 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-05 08:20:42,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:42,924 INFO L93 Difference]: Finished difference Result 465 states and 655 transitions. [2024-11-05 08:20:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-05 08:20:42,926 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 17 states have internal predecessors, (90), 9 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 11 states have call predecessors, (22), 9 states have call successors, (22) Word has length 133 [2024-11-05 08:20:42,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:42,928 INFO L225 Difference]: With dead ends: 465 [2024-11-05 08:20:42,928 INFO L226 Difference]: Without dead ends: 294 [2024-11-05 08:20:42,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 251 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2024-11-05 08:20:42,930 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 142 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:42,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1469 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-05 08:20:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-05 08:20:42,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 253. [2024-11-05 08:20:42,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 175 states have (on average 1.2685714285714285) internal successors, (222), 185 states have internal predecessors, (222), 57 states have call successors, (57), 16 states have call predecessors, (57), 20 states have return successors, (74), 53 states have call predecessors, (74), 53 states have call successors, (74) [2024-11-05 08:20:42,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 353 transitions. [2024-11-05 08:20:42,954 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 353 transitions. Word has length 133 [2024-11-05 08:20:42,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:42,954 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 353 transitions. [2024-11-05 08:20:42,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 4.7368421052631575) internal successors, (90), 17 states have internal predecessors, (90), 9 states have call successors, (23), 3 states have call predecessors, (23), 6 states have return successors, (22), 11 states have call predecessors, (22), 9 states have call successors, (22) [2024-11-05 08:20:42,955 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 353 transitions. [2024-11-05 08:20:42,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-05 08:20:42,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:42,956 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-05 08:20:42,973 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:43,156 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:43,157 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:43,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1714146762, now seen corresponding path program 1 times [2024-11-05 08:20:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:43,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [770805038] [2024-11-05 08:20:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:43,158 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:43,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:43,161 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:43,162 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:43,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:43,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:20:43,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-11-05 08:20:43,688 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-05 08:20:43,899 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:43,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [770805038] [2024-11-05 08:20:43,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [770805038] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:43,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:43,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2024-11-05 08:20:43,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858901550] [2024-11-05 08:20:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:43,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:20:43,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:43,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:20:43,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-05 08:20:43,901 INFO L87 Difference]: Start difference. First operand 253 states and 353 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-05 08:20:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:43,963 INFO L93 Difference]: Finished difference Result 489 states and 702 transitions. [2024-11-05 08:20:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:20:43,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 143 [2024-11-05 08:20:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:43,966 INFO L225 Difference]: With dead ends: 489 [2024-11-05 08:20:43,967 INFO L226 Difference]: Without dead ends: 245 [2024-11-05 08:20:43,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:20:43,968 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 3 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:43,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 553 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:20:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-05 08:20:43,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2024-11-05 08:20:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 167 states have (on average 1.2455089820359282) internal successors, (208), 175 states have internal predecessors, (208), 57 states have call successors, (57), 16 states have call predecessors, (57), 18 states have return successors, (69), 53 states have call predecessors, (69), 53 states have call successors, (69) [2024-11-05 08:20:43,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 334 transitions. [2024-11-05 08:20:43,992 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 334 transitions. Word has length 143 [2024-11-05 08:20:43,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:43,992 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 334 transitions. [2024-11-05 08:20:43,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-05 08:20:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 334 transitions. [2024-11-05 08:20:43,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-05 08:20:43,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:43,994 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2024-11-05 08:20:44,011 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:44,194 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:44,195 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:44,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash 652547832, now seen corresponding path program 1 times [2024-11-05 08:20:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:44,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2112224085] [2024-11-05 08:20:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:44,195 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:44,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:44,198 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:44,200 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:44,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:44,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-05 08:20:44,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 83 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-05 08:20:45,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:45,498 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:20:45,498 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:45,624 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-05 08:20:45,625 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:45,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2112224085] [2024-11-05 08:20:45,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2112224085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:20:45,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:20:45,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-11-05 08:20:45,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245576700] [2024-11-05 08:20:45,625 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:20:45,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-05 08:20:45,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:45,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-05 08:20:45,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2024-11-05 08:20:45,627 INFO L87 Difference]: Start difference. First operand 243 states and 334 transitions. Second operand has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 15 states have internal predecessors, (98), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-05 08:20:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:53,408 INFO L93 Difference]: Finished difference Result 546 states and 783 transitions. [2024-11-05 08:20:53,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-05 08:20:53,409 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 15 states have internal predecessors, (98), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 143 [2024-11-05 08:20:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:53,412 INFO L225 Difference]: With dead ends: 546 [2024-11-05 08:20:53,412 INFO L226 Difference]: Without dead ends: 322 [2024-11-05 08:20:53,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=113, Invalid=639, Unknown=4, NotChecked=0, Total=756 [2024-11-05 08:20:53,414 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 63 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 20 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 1644 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:20:53,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 1644 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 610 Invalid, 5 Unknown, 0 Unchecked, 7.2s Time] [2024-11-05 08:20:53,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-05 08:20:53,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 251. [2024-11-05 08:20:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 173 states have (on average 1.2427745664739884) internal successors, (215), 182 states have internal predecessors, (215), 57 states have call successors, (57), 16 states have call predecessors, (57), 20 states have return successors, (72), 54 states have call predecessors, (72), 53 states have call successors, (72) [2024-11-05 08:20:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 344 transitions. [2024-11-05 08:20:53,441 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 344 transitions. Word has length 143 [2024-11-05 08:20:53,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:53,441 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 344 transitions. [2024-11-05 08:20:53,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.764705882352941) internal successors, (98), 15 states have internal predecessors, (98), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-05 08:20:53,441 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 344 transitions. [2024-11-05 08:20:53,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-05 08:20:53,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:53,443 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-05 08:20:53,463 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 (20)] Ended with exit code 0 [2024-11-05 08:20:53,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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:53,643 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:53,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:53,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1396840010, now seen corresponding path program 1 times [2024-11-05 08:20:53,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:53,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386290104] [2024-11-05 08:20:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:53,644 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:53,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:53,645 INFO L229 MonitoredProcess]: Starting monitored process 21 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:53,647 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 (21)] Waiting until timeout for monitored process [2024-11-05 08:20:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:54,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:20:54,067 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:54,093 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2024-11-05 08:20:54,093 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-05 08:20:54,222 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:54,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386290104] [2024-11-05 08:20:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [386290104] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:20:54,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:20:54,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-05 08:20:54,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712518643] [2024-11-05 08:20:54,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:20:54,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:20:54,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:54,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:20:54,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:20:54,224 INFO L87 Difference]: Start difference. First operand 251 states and 344 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-05 08:20:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:20:54,268 INFO L93 Difference]: Finished difference Result 483 states and 689 transitions. [2024-11-05 08:20:54,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:20:54,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 143 [2024-11-05 08:20:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:20:54,271 INFO L225 Difference]: With dead ends: 483 [2024-11-05 08:20:54,271 INFO L226 Difference]: Without dead ends: 251 [2024-11-05 08:20:54,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 281 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:54,273 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 577 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:54,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 577 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:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-05 08:20:54,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 240. [2024-11-05 08:20:54,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 164 states have (on average 1.2134146341463414) internal successors, (199), 172 states have internal predecessors, (199), 56 states have call successors, (56), 15 states have call predecessors, (56), 19 states have return successors, (70), 54 states have call predecessors, (70), 52 states have call successors, (70) [2024-11-05 08:20:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 325 transitions. [2024-11-05 08:20:54,317 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 325 transitions. Word has length 143 [2024-11-05 08:20:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:20:54,318 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 325 transitions. [2024-11-05 08:20:54,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-05 08:20:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 325 transitions. [2024-11-05 08:20:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-05 08:20:54,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:20:54,319 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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] [2024-11-05 08:20:54,338 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 (21)] Ended with exit code 0 [2024-11-05 08:20:54,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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:54,524 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:20:54,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:20:54,524 INFO L85 PathProgramCache]: Analyzing trace with hash 624157012, now seen corresponding path program 3 times [2024-11-05 08:20:54,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:20:54,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2079886825] [2024-11-05 08:20:54,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:20:54,524 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:54,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:20:54,525 INFO L229 MonitoredProcess]: Starting monitored process 22 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:54,526 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 (22)] Waiting until timeout for monitored process [2024-11-05 08:20:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:20:54,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-05 08:20:54,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:20:55,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2024-11-05 08:20:55,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 7 treesize of output 3 [2024-11-05 08:20:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 53 proven. 39 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2024-11-05 08:20:55,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:20:56,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:20:56,200 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 26 treesize of output 29 [2024-11-05 08:20:56,225 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:20:56,225 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 27 [2024-11-05 08:20:56,363 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 0 proven. 41 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-05 08:20:56,363 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:20:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2079886825] [2024-11-05 08:20:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2079886825] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:20:56,363 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:20:56,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 15 [2024-11-05 08:20:56,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128734179] [2024-11-05 08:20:56,363 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:20:56,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-05 08:20:56,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:20:56,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-05 08:20:56,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-05 08:20:56,365 INFO L87 Difference]: Start difference. First operand 240 states and 325 transitions. Second operand has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 10 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2024-11-05 08:21:00,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:21:00,786 INFO L93 Difference]: Finished difference Result 750 states and 1015 transitions. [2024-11-05 08:21:00,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-05 08:21:00,788 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 10 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) Word has length 144 [2024-11-05 08:21:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:21:00,792 INFO L225 Difference]: With dead ends: 750 [2024-11-05 08:21:00,792 INFO L226 Difference]: Without dead ends: 516 [2024-11-05 08:21:00,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 273 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2024-11-05 08:21:00,794 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 119 mSDsluCounter, 1361 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:21:00,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 1515 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-05 08:21:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2024-11-05 08:21:00,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 431. [2024-11-05 08:21:00,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 295 states have (on average 1.2067796610169492) internal successors, (356), 308 states have internal predecessors, (356), 100 states have call successors, (100), 28 states have call predecessors, (100), 35 states have return successors, (123), 97 states have call predecessors, (123), 92 states have call successors, (123) [2024-11-05 08:21:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 579 transitions. [2024-11-05 08:21:00,843 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 579 transitions. Word has length 144 [2024-11-05 08:21:00,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:21:00,843 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 579 transitions. [2024-11-05 08:21:00,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.928571428571429) internal successors, (111), 15 states have internal predecessors, (111), 10 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (22), 9 states have call predecessors, (22), 10 states have call successors, (22) [2024-11-05 08:21:00,844 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 579 transitions. [2024-11-05 08:21:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-05 08:21:00,845 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:21:00,845 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1] [2024-11-05 08:21:00,864 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 (22)] Ended with exit code 0 [2024-11-05 08:21:01,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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:21:01,045 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:21:01,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:21:01,046 INFO L85 PathProgramCache]: Analyzing trace with hash 384497120, now seen corresponding path program 1 times [2024-11-05 08:21:01,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:21:01,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [260598983] [2024-11-05 08:21:01,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:21:01,046 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:21:01,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:21:01,047 INFO L229 MonitoredProcess]: Starting monitored process 23 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:21:01,048 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 (23)] Waiting until timeout for monitored process [2024-11-05 08:21:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:21:01,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:21:01,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:21:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-05 08:21:01,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:21:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-05 08:21:01,777 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:21:01,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [260598983] [2024-11-05 08:21:01,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [260598983] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:21:01,777 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:21:01,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2024-11-05 08:21:01,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496681600] [2024-11-05 08:21:01,778 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:21:01,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:21:01,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:21:01,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:21:01,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:21:01,779 INFO L87 Difference]: Start difference. First operand 431 states and 579 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-05 08:21:03,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:21:03,997 INFO L93 Difference]: Finished difference Result 825 states and 1105 transitions. [2024-11-05 08:21:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:21:03,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 151 [2024-11-05 08:21:03,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:21:04,002 INFO L225 Difference]: With dead ends: 825 [2024-11-05 08:21:04,002 INFO L226 Difference]: Without dead ends: 445 [2024-11-05 08:21:04,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:21:04,006 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 59 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:21:04,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 733 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-05 08:21:04,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-11-05 08:21:04,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2024-11-05 08:21:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 445 states, 302 states have (on average 1.2019867549668874) internal successors, (363), 316 states have internal predecessors, (363), 105 states have call successors, (105), 29 states have call predecessors, (105), 37 states have return successors, (132), 102 states have call predecessors, (132), 97 states have call successors, (132) [2024-11-05 08:21:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 600 transitions. [2024-11-05 08:21:04,084 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 600 transitions. Word has length 151 [2024-11-05 08:21:04,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:21:04,085 INFO L471 AbstractCegarLoop]: Abstraction has 445 states and 600 transitions. [2024-11-05 08:21:04,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-05 08:21:04,085 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 600 transitions. [2024-11-05 08:21:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-05 08:21:04,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:21:04,086 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 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:21:04,104 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 (23)] Forceful destruction successful, exit code 0 [2024-11-05 08:21:04,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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:21:04,291 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:21:04,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:21:04,291 INFO L85 PathProgramCache]: Analyzing trace with hash -942690132, now seen corresponding path program 1 times [2024-11-05 08:21:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:21:04,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1400321212] [2024-11-05 08:21:04,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:21:04,292 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:21:04,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:21:04,293 INFO L229 MonitoredProcess]: Starting monitored process 24 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:21:04,294 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 (24)] Waiting until timeout for monitored process [2024-11-05 08:21:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:21:04,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-05 08:21:04,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:21:10,646 INFO L349 Elim1Store]: treesize reduction 46, result has 72.1 percent of original size [2024-11-05 08:21:10,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 85 treesize of output 169 [2024-11-05 08:21:10,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:21:10,676 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 129 treesize of output 101 [2024-11-05 08:21:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 109 proven. 11 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-05 08:21:10,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:21:11,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 19 [2024-11-05 08:21:11,374 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-11-05 08:21:11,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 25 [2024-11-05 08:21:24,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:21:24,011 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 27 treesize of output 30