/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_front_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:16:52,286 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:16:52,347 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:16:52,352 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:16:52,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:16:52,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:16:52,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:16:52,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:16:52,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:16:52,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:16:52,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:16:52,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:16:52,384 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:16:52,384 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:16:52,384 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:16:52,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:16:52,385 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:16:52,389 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:16:52,389 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:16:52,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:16:52,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:16:52,390 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:16:52,390 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:16:52,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:16:52,391 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:16:52,391 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:16:52,391 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:16:52,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:16:52,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:16:52,392 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:16:52,392 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:16:52,392 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:16:52,392 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:16:52,392 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:16:52,393 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:16:52,393 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:16:52,395 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:16:52,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:16:52,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:16:52,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:16:52,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:16:52,396 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:16:52,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:16:52,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:16:52,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:16:52,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:16:52,654 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:16:52,655 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_front_harness.i [2024-11-05 08:16:54,140 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:16:54,641 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:16:54,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness.i [2024-11-05 08:16:54,677 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807afba09/c3c4b64b21ed42c59ce515946d995810/FLAG591ae193e [2024-11-05 08:16:54,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807afba09/c3c4b64b21ed42c59ce515946d995810 [2024-11-05 08:16:54,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:16:54,703 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:16:54,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:16:54,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:16:54,710 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:16:54,711 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:16:54" (1/1) ... [2024-11-05 08:16:54,712 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b580b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:54, skipping insertion in model container [2024-11-05 08:16:54,712 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:16:54" (1/1) ... [2024-11-05 08:16:54,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:16:55,126 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_front_harness.i[4495,4508] [2024-11-05 08:16:55,137 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_front_harness.i[4555,4568] [2024-11-05 08:16:56,049 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:16:56,130 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:16:56,131 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:16:56,132 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:16:56,142 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:16:56,144 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,145 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,145 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,146 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:16:56,146 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,147 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,152 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:16:56,153 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:16:56,155 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:16:56,156 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:16:56,164 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,165 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:16:56,165 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,165 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:16:56,167 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,167 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:16:56,167 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,168 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:16:56,169 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,170 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:16:56,170 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,170 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:16:56,171 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,171 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,464 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:16:56,465 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:16:56,465 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:16:56,466 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:16:56,609 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:16:56,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:16:56,670 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 08:16:56,702 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:16:56,710 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_front_harness.i[4495,4508] [2024-11-05 08:16:56,711 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_front_harness.i[4555,4568] [2024-11-05 08:16:56,746 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:16:56,765 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:16:56,766 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:16:56,766 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:16:56,779 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:16:56,780 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,780 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,781 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,781 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:16:56,781 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,782 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,783 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:16:56,783 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:16:56,789 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:16:56,789 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:16:56,798 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,798 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:16:56,799 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,799 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:16:56,800 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,803 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:16:56,804 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,804 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:16:56,805 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,806 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:16:56,806 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,806 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:16:56,806 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,807 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:56,888 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:16:56,889 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:16:56,890 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:16:56,890 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:16:56,925 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:16:56,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:16:56,944 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:16:56,958 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_front_harness.i[4495,4508] [2024-11-05 08:16:56,959 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_front_harness.i[4555,4568] [2024-11-05 08:16:57,024 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,025 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,025 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,025 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,026 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,033 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,033 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,034 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,035 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,036 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,036 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,037 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,037 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:16:57,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:16:57,376 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 08:16:57,385 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:16:57,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57 WrapperNode [2024-11-05 08:16:57,387 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:16:57,388 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:16:57,388 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:16:57,388 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:16:57,397 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:16:57" (1/1) ... [2024-11-05 08:16:57,479 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:16:57" (1/1) ... [2024-11-05 08:16:57,561 INFO L138 Inliner]: procedures = 687, calls = 1043, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 136 [2024-11-05 08:16:57,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:16:57,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:16:57,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:16:57,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:16:57,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (1/1) ... [2024-11-05 08:16:57,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (1/1) ... [2024-11-05 08:16:57,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (1/1) ... [2024-11-05 08:16:57,625 INFO L175 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 5, 20]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-05 08:16:57,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (1/1) ... [2024-11-05 08:16:57,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (1/1) ... [2024-11-05 08:16:57,648 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (1/1) ... [2024-11-05 08:16:57,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (1/1) ... [2024-11-05 08:16:57,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (1/1) ... [2024-11-05 08:16:57,674 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (1/1) ... [2024-11-05 08:16:57,685 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:16:57,686 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:16:57,686 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:16:57,686 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:16:57,687 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (1/1) ... [2024-11-05 08:16:57,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:16:57,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:16:57,721 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:16:57,725 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:16:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:16:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:16:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:16:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:16:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 08:16:57,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 08:16:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:16:57,758 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:16:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-05 08:16:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-05 08:16:57,758 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-05 08:16:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:16:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 08:16:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 08:16:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 08:16:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2024-11-05 08:16:57,759 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2024-11-05 08:16:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:16:57,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:16:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-05 08:16:57,760 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-05 08:16:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:16:57,760 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:16:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:16:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 08:16:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 08:16:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 08:16:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 08:16:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 08:16:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 08:16:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-05 08:16:57,760 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-05 08:16:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-05 08:16:57,761 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-05 08:16:58,044 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:16:58,046 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:16:58,542 INFO L? ?]: Removed 61 outVars from TransFormulas that were not future-live. [2024-11-05 08:16:58,542 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:16:58,566 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:16:58,567 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-05 08:16:58,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:16:58 BoogieIcfgContainer [2024-11-05 08:16:58,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:16:58,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:16:58,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:16:58,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:16:58,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:16:54" (1/3) ... [2024-11-05 08:16:58,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7701f49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:16:58, skipping insertion in model container [2024-11-05 08:16:58,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:16:57" (2/3) ... [2024-11-05 08:16:58,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7701f49d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:16:58, skipping insertion in model container [2024-11-05 08:16:58,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:16:58" (3/3) ... [2024-11-05 08:16:58,578 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness.i [2024-11-05 08:16:58,596 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:16:58,596 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:16:58,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:16:58,665 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;@d97b82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:16:58,666 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:16:58,670 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-05 08:16:58,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:16:58,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:58,682 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:16:58,682 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:58,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1606468667, now seen corresponding path program 1 times [2024-11-05 08:16:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:58,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [712021016] [2024-11-05 08:16:58,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:58,703 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:16:58,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:58,707 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:16:58,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 (2)] Waiting until timeout for monitored process [2024-11-05 08:16:59,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:59,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:16:59,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:59,072 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-05 08:16:59,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:16:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2024-11-05 08:16:59,186 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:16:59,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [712021016] [2024-11-05 08:16:59,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [712021016] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:16:59,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:16:59,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 08:16:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946887872] [2024-11-05 08:16:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:16:59,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:16:59,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:16:59,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:16:59,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:16:59,228 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.296875) internal successors, (83), 65 states have internal predecessors, (83), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-05 08:16:59,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:16:59,266 INFO L93 Difference]: Finished difference Result 188 states and 271 transitions. [2024-11-05 08:16:59,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:16:59,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 84 [2024-11-05 08:16:59,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:16:59,276 INFO L225 Difference]: With dead ends: 188 [2024-11-05 08:16:59,277 INFO L226 Difference]: Without dead ends: 93 [2024-11-05 08:16:59,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 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:16:59,286 INFO L432 NwaCegarLoop]: 127 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, 127 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:16:59,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:16:59,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-05 08:16:59,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-05 08:16:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-05 08:16:59,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2024-11-05 08:16:59,332 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 84 [2024-11-05 08:16:59,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:16:59,332 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2024-11-05 08:16:59,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-05 08:16:59,333 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2024-11-05 08:16:59,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-05 08:16:59,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:16:59,336 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:16:59,343 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 (2)] Ended with exit code 0 [2024-11-05 08:16:59,537 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:16:59,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:16:59,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:16:59,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1607570691, now seen corresponding path program 1 times [2024-11-05 08:16:59,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:16:59,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1108529560] [2024-11-05 08:16:59,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:16:59,539 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:16:59,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:16:59,541 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:16:59,542 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:16:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:16:59,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:16:59,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:16:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 08:16:59,900 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-05 08:17:00,032 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1108529560] [2024-11-05 08:17:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1108529560] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:17:00,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:17:00,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-05 08:17:00,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454449393] [2024-11-05 08:17:00,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:00,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:17:00,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:00,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:17:00,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:17:00,040 INFO L87 Difference]: Start difference. First operand 93 states and 122 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-05 08:17:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:00,150 INFO L93 Difference]: Finished difference Result 169 states and 224 transitions. [2024-11-05 08:17:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:17:00,155 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 84 [2024-11-05 08:17:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:00,159 INFO L225 Difference]: With dead ends: 169 [2024-11-05 08:17:00,159 INFO L226 Difference]: Without dead ends: 95 [2024-11-05 08:17:00,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 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:17:00,161 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:00,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 564 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:17:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-05 08:17:00,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-05 08:17:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 63 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-05 08:17:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 125 transitions. [2024-11-05 08:17:00,175 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 125 transitions. Word has length 84 [2024-11-05 08:17:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:00,175 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 125 transitions. [2024-11-05 08:17:00,176 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, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-05 08:17:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 125 transitions. [2024-11-05 08:17:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-05 08:17:00,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:00,178 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-11-05 08:17:00,187 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:17:00,378 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:17:00,379 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:00,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash -254868999, now seen corresponding path program 1 times [2024-11-05 08:17:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:00,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [448034888] [2024-11-05 08:17:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:00,380 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:17:00,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:00,383 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:17:00,384 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:17:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:00,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:17:00,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 08:17:00,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-05 08:17:00,962 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [448034888] [2024-11-05 08:17:00,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [448034888] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:17:00,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:17:00,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 10 [2024-11-05 08:17:00,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410368771] [2024-11-05 08:17:00,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:00,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:17:00,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:00,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:17:00,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:17:00,964 INFO L87 Difference]: Start difference. First operand 95 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:17:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:01,223 INFO L93 Difference]: Finished difference Result 176 states and 233 transitions. [2024-11-05 08:17:01,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:17:01,227 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 86 [2024-11-05 08:17:01,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:01,229 INFO L225 Difference]: With dead ends: 176 [2024-11-05 08:17:01,229 INFO L226 Difference]: Without dead ends: 97 [2024-11-05 08:17:01,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-05 08:17:01,235 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 32 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:01,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 681 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:17:01,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-05 08:17:01,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2024-11-05 08:17:01,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 63 states have internal predecessors, (75), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-05 08:17:01,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2024-11-05 08:17:01,250 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 86 [2024-11-05 08:17:01,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:01,251 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2024-11-05 08:17:01,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:17:01,251 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2024-11-05 08:17:01,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-05 08:17:01,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:01,255 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-11-05 08:17:01,265 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 (4)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:01,455 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:17:01,456 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:01,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:01,457 INFO L85 PathProgramCache]: Analyzing trace with hash -2045206106, now seen corresponding path program 1 times [2024-11-05 08:17:01,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:01,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2123297165] [2024-11-05 08:17:01,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:01,457 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:17:01,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:01,460 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:17:01,462 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:17:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:01,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:17:01,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:01,823 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-05 08:17:01,824 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:02,058 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-05 08:17:02,059 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:02,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2123297165] [2024-11-05 08:17:02,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2123297165] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:17:02,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:17:02,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 12 [2024-11-05 08:17:02,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443059103] [2024-11-05 08:17:02,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:02,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 08:17:02,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:02,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 08:17:02,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-05 08:17:02,061 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:17:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:02,347 INFO L93 Difference]: Finished difference Result 182 states and 241 transitions. [2024-11-05 08:17:02,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:17:02,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 88 [2024-11-05 08:17:02,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:02,350 INFO L225 Difference]: With dead ends: 182 [2024-11-05 08:17:02,351 INFO L226 Difference]: Without dead ends: 102 [2024-11-05 08:17:02,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2024-11-05 08:17:02,357 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 41 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:02,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 765 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:17:02,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-05 08:17:02,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2024-11-05 08:17:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-05 08:17:02,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2024-11-05 08:17:02,378 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 88 [2024-11-05 08:17:02,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:02,378 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2024-11-05 08:17:02,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:17:02,379 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2024-11-05 08:17:02,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-05 08:17:02,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:02,380 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2024-11-05 08:17:02,394 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:17:02,587 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:17:02,588 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:02,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:02,588 INFO L85 PathProgramCache]: Analyzing trace with hash -708361508, now seen corresponding path program 1 times [2024-11-05 08:17:02,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:02,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [25280428] [2024-11-05 08:17:02,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:02,589 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:17:02,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:02,590 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:17:02,591 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:17:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:02,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:17:02,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:02,909 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-05 08:17:02,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:03,002 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2024-11-05 08:17:03,003 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:03,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [25280428] [2024-11-05 08:17:03,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [25280428] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:17:03,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:17:03,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [3] total 9 [2024-11-05 08:17:03,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303587244] [2024-11-05 08:17:03,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:03,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:17:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:03,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:17:03,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:17:03,005 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:17:03,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:03,220 INFO L93 Difference]: Finished difference Result 179 states and 238 transitions. [2024-11-05 08:17:03,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:17:03,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 89 [2024-11-05 08:17:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:03,225 INFO L225 Difference]: With dead ends: 179 [2024-11-05 08:17:03,226 INFO L226 Difference]: Without dead ends: 102 [2024-11-05 08:17:03,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:17:03,229 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 34 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:03,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 657 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:17:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-05 08:17:03,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 97. [2024-11-05 08:17:03,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 63 states have (on average 1.2222222222222223) internal successors, (77), 65 states have internal predecessors, (77), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-05 08:17:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 126 transitions. [2024-11-05 08:17:03,246 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 126 transitions. Word has length 89 [2024-11-05 08:17:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:03,247 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 126 transitions. [2024-11-05 08:17:03,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (13), 3 states have call predecessors, (13), 2 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2024-11-05 08:17:03,247 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 126 transitions. [2024-11-05 08:17:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-05 08:17:03,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:03,248 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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:17:03,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:03,452 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:17:03,453 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:03,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:03,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1326114882, now seen corresponding path program 1 times [2024-11-05 08:17:03,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:03,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [508736955] [2024-11-05 08:17:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:03,454 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:17:03,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:03,456 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:17:03,457 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:17:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:03,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:17:03,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-05 08:17:03,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:03,848 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-05 08:17:03,848 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:03,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [508736955] [2024-11-05 08:17:03,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [508736955] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:17:03,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:17:03,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-05 08:17:03,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977369743] [2024-11-05 08:17:03,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:03,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:17:03,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:03,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:17:03,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:17:03,851 INFO L87 Difference]: Start difference. First operand 97 states and 126 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-05 08:17:03,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:03,941 INFO L93 Difference]: Finished difference Result 178 states and 233 transitions. [2024-11-05 08:17:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:17:03,942 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 97 [2024-11-05 08:17:03,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:03,944 INFO L225 Difference]: With dead ends: 178 [2024-11-05 08:17:03,944 INFO L226 Difference]: Without dead ends: 100 [2024-11-05 08:17:03,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 186 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:17:03,948 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 0 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:03,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 666 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:17:03,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-05 08:17:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2024-11-05 08:17:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.21875) internal successors, (78), 66 states have internal predecessors, (78), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2024-11-05 08:17:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 127 transitions. [2024-11-05 08:17:03,973 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 127 transitions. Word has length 97 [2024-11-05 08:17:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:03,973 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 127 transitions. [2024-11-05 08:17:03,973 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, (14), 2 states have call predecessors, (14), 4 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-05 08:17:03,974 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 127 transitions. [2024-11-05 08:17:03,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-05 08:17:03,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:03,975 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1] [2024-11-05 08:17:03,984 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 (7)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:04,176 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:17:04,176 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:04,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash -720348629, now seen corresponding path program 1 times [2024-11-05 08:17:04,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:04,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1708455457] [2024-11-05 08:17:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:04,177 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:17:04,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:04,179 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:17:04,180 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:17:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:04,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-05 08:17:04,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:08,915 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2024-11-05 08:17:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 50 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-05 08:17:09,124 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-05 08:17:09,420 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:09,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1708455457] [2024-11-05 08:17:09,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1708455457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:17:09,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:17:09,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-05 08:17:09,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319229254] [2024-11-05 08:17:09,421 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:17:09,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:17:09,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:09,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:17:09,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2024-11-05 08:17:09,422 INFO L87 Difference]: Start difference. First operand 98 states and 127 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-05 08:17:10,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:10,191 INFO L93 Difference]: Finished difference Result 221 states and 300 transitions. [2024-11-05 08:17:10,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 08:17:10,193 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 99 [2024-11-05 08:17:10,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:10,196 INFO L225 Difference]: With dead ends: 221 [2024-11-05 08:17:10,196 INFO L226 Difference]: Without dead ends: 142 [2024-11-05 08:17:10,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 182 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:17:10,197 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 53 mSDsluCounter, 719 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 299 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:10,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 841 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 295 Invalid, 0 Unknown, 299 Unchecked, 0.6s Time] [2024-11-05 08:17:10,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-05 08:17:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 116. [2024-11-05 08:17:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 80 states have (on average 1.25) internal successors, (100), 82 states have internal predecessors, (100), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-05 08:17:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 152 transitions. [2024-11-05 08:17:10,217 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 152 transitions. Word has length 99 [2024-11-05 08:17:10,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:10,217 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 152 transitions. [2024-11-05 08:17:10,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2024-11-05 08:17:10,217 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 152 transitions. [2024-11-05 08:17:10,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-05 08:17:10,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:10,219 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1] [2024-11-05 08:17:10,231 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:17:10,419 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:17:10,420 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:10,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1241226029, now seen corresponding path program 1 times [2024-11-05 08:17:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:10,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1791977835] [2024-11-05 08:17:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:10,421 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:17:10,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:10,422 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:17:10,423 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:17:10,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:10,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 08:17:10,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:10,619 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-05 08:17:10,619 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:10,665 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-05 08:17:10,665 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:10,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1791977835] [2024-11-05 08:17:10,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1791977835] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:17:10,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:17:10,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-05 08:17:10,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693028803] [2024-11-05 08:17:10,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:10,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:17:10,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:10,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:17:10,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:17:10,667 INFO L87 Difference]: Start difference. First operand 116 states and 152 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 08:17:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:10,693 INFO L93 Difference]: Finished difference Result 214 states and 286 transitions. [2024-11-05 08:17:10,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:17:10,694 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-05 08:17:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:10,696 INFO L225 Difference]: With dead ends: 214 [2024-11-05 08:17:10,696 INFO L226 Difference]: Without dead ends: 117 [2024-11-05 08:17:10,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 194 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:17:10,697 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 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:17:10,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:17:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-05 08:17:10,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-05 08:17:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 80 states have (on average 1.2375) internal successors, (99), 82 states have internal predecessors, (99), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-05 08:17:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 151 transitions. [2024-11-05 08:17:10,707 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 151 transitions. Word has length 99 [2024-11-05 08:17:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:10,708 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 151 transitions. [2024-11-05 08:17:10,708 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 08:17:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 151 transitions. [2024-11-05 08:17:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-05 08:17:10,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:10,709 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:10,717 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:17:10,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:17:10,910 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:10,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:10,910 INFO L85 PathProgramCache]: Analyzing trace with hash 1801925807, now seen corresponding path program 1 times [2024-11-05 08:17:10,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:10,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2061933210] [2024-11-05 08:17:10,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:10,911 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:17:10,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:10,912 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:17:10,913 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:17:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:11,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:17:11,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:11,097 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 08:17:11,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:11,169 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-05 08:17:11,170 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:11,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2061933210] [2024-11-05 08:17:11,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2061933210] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:17:11,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:17:11,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-05 08:17:11,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733488359] [2024-11-05 08:17:11,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:11,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:17:11,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:11,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:17:11,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:17:11,171 INFO L87 Difference]: Start difference. First operand 116 states and 151 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 08:17:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:11,201 INFO L93 Difference]: Finished difference Result 213 states and 285 transitions. [2024-11-05 08:17:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:17:11,202 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2024-11-05 08:17:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:11,205 INFO L225 Difference]: With dead ends: 213 [2024-11-05 08:17:11,205 INFO L226 Difference]: Without dead ends: 116 [2024-11-05 08:17:11,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 193 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:17:11,206 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 467 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:17:11,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:17:11,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-05 08:17:11,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2024-11-05 08:17:11,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 79 states have internal predecessors, (94), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (27), 24 states have call predecessors, (27), 24 states have call successors, (27) [2024-11-05 08:17:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2024-11-05 08:17:11,220 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 99 [2024-11-05 08:17:11,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:11,221 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2024-11-05 08:17:11,221 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-05 08:17:11,221 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2024-11-05 08:17:11,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-05 08:17:11,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:11,222 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1] [2024-11-05 08:17:11,232 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 (10)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:11,422 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:17:11,423 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:11,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:11,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1707514615, now seen corresponding path program 1 times [2024-11-05 08:17:11,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:11,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [179463855] [2024-11-05 08:17:11,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:11,424 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:17:11,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:11,425 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:17:11,426 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:17:11,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:11,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-05 08:17:11,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:15,935 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_6 (_ BitVec 64))) (not (= v_aws_linked_list_front_~list.base_BEFORE_CALL_6 (select (select |c_#memory_$Pointer$#2.base| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (_ bv0 64))))) (exists ((v_aws_linked_list_front_~list.base_BEFORE_CALL_6 (_ BitVec 64))) (not (= (_ bv16 64) (select (select |c_#memory_$Pointer$#2.offset| v_aws_linked_list_front_~list.base_BEFORE_CALL_6) (_ bv0 64)))))) is different from true [2024-11-05 08:17:17,244 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-05 08:17:17,244 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:23,417 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:17:23,418 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 25 [2024-11-05 08:17:23,440 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-05 08:17:23,440 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 16 [2024-11-05 08:17:23,512 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-05 08:17:23,512 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:23,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [179463855] [2024-11-05 08:17:23,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [179463855] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:17:23,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:17:23,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2024-11-05 08:17:23,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702268452] [2024-11-05 08:17:23,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:17:23,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-05 08:17:23,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:23,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-05 08:17:23,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=672, Unknown=2, NotChecked=52, Total=812 [2024-11-05 08:17:23,515 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2024-11-05 08:17:30,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:17:35,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:17:39,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:17:43,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:17:47,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:17:47,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:47,860 INFO L93 Difference]: Finished difference Result 265 states and 345 transitions. [2024-11-05 08:17:47,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-05 08:17:47,862 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 100 [2024-11-05 08:17:47,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:47,863 INFO L225 Difference]: With dead ends: 265 [2024-11-05 08:17:47,863 INFO L226 Difference]: Without dead ends: 153 [2024-11-05 08:17:47,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=128, Invalid=996, Unknown=2, NotChecked=64, Total=1190 [2024-11-05 08:17:47,865 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 89 mSDsluCounter, 1077 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 66 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 446 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:47,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 1181 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1094 Invalid, 5 Unknown, 446 Unchecked, 23.5s Time] [2024-11-05 08:17:47,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-05 08:17:47,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 141. [2024-11-05 08:17:47,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 102 states have (on average 1.2156862745098038) internal successors, (124), 103 states have internal predecessors, (124), 27 states have call successors, (27), 11 states have call predecessors, (27), 11 states have return successors, (30), 26 states have call predecessors, (30), 26 states have call successors, (30) [2024-11-05 08:17:47,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 181 transitions. [2024-11-05 08:17:47,882 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 181 transitions. Word has length 100 [2024-11-05 08:17:47,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:47,882 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 181 transitions. [2024-11-05 08:17:47,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 25 states have (on average 4.6) internal successors, (115), 25 states have internal predecessors, (115), 12 states have call successors, (26), 5 states have call predecessors, (26), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2024-11-05 08:17:47,882 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 181 transitions. [2024-11-05 08:17:47,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-05 08:17:47,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:47,883 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:47,894 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:17:48,084 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:17:48,084 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:48,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:48,085 INFO L85 PathProgramCache]: Analyzing trace with hash 65047686, now seen corresponding path program 2 times [2024-11-05 08:17:48,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:48,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1936827842] [2024-11-05 08:17:48,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:48,085 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:17:48,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:48,086 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:17:48,087 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:17:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:48,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-05 08:17:48,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 53 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-05 08:17:48,764 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:49,200 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:17:49,201 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:17:49,287 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-05 08:17:49,288 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:49,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1936827842] [2024-11-05 08:17:49,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1936827842] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:17:49,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:17:49,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-11-05 08:17:49,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526184430] [2024-11-05 08:17:49,288 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:17:49,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-05 08:17:49,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-05 08:17:49,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=231, Unknown=2, NotChecked=0, Total=272 [2024-11-05 08:17:49,290 INFO L87 Difference]: Start difference. First operand 141 states and 181 transitions. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 15 states have internal predecessors, (93), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-05 08:17:51,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:51,051 INFO L93 Difference]: Finished difference Result 277 states and 375 transitions. [2024-11-05 08:17:51,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-05 08:17:51,051 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 15 states have internal predecessors, (93), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) Word has length 110 [2024-11-05 08:17:51,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:51,053 INFO L225 Difference]: With dead ends: 277 [2024-11-05 08:17:51,053 INFO L226 Difference]: Without dead ends: 182 [2024-11-05 08:17:51,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=125, Invalid=743, Unknown=2, NotChecked=0, Total=870 [2024-11-05 08:17:51,055 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 67 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 19 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:51,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 1178 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 487 Invalid, 4 Unknown, 0 Unchecked, 1.2s Time] [2024-11-05 08:17:51,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-05 08:17:51,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 148. [2024-11-05 08:17:51,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 108 states have (on average 1.212962962962963) internal successors, (131), 108 states have internal predecessors, (131), 27 states have call successors, (27), 11 states have call predecessors, (27), 12 states have return successors, (36), 28 states have call predecessors, (36), 26 states have call successors, (36) [2024-11-05 08:17:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 194 transitions. [2024-11-05 08:17:51,077 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 194 transitions. Word has length 110 [2024-11-05 08:17:51,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:51,078 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 194 transitions. [2024-11-05 08:17:51,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 15 states have internal predecessors, (93), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (19), 5 states have call predecessors, (19), 4 states have call successors, (19) [2024-11-05 08:17:51,078 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 194 transitions. [2024-11-05 08:17:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-05 08:17:51,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:51,079 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:51,090 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:17:51,279 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:17:51,280 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:51,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:51,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2004209732, now seen corresponding path program 1 times [2024-11-05 08:17:51,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:51,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1347689713] [2024-11-05 08:17:51,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:51,281 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:17:51,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:51,282 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:17:51,283 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:17:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:51,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:17:51,469 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:51,492 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-05 08:17:51,492 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-05 08:17:51,573 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:51,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1347689713] [2024-11-05 08:17:51,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1347689713] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:17:51,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:17:51,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-05 08:17:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14859832] [2024-11-05 08:17:51,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:51,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:17:51,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:51,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:17:51,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:17:51,575 INFO L87 Difference]: Start difference. First operand 148 states and 194 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-05 08:17:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:51,607 INFO L93 Difference]: Finished difference Result 256 states and 342 transitions. [2024-11-05 08:17:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:17:51,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2024-11-05 08:17:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:51,609 INFO L225 Difference]: With dead ends: 256 [2024-11-05 08:17:51,609 INFO L226 Difference]: Without dead ends: 146 [2024-11-05 08:17:51,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 215 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:17:51,610 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 485 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:17:51,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 485 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:17:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-05 08:17:51,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-05 08:17:51,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 105 states have (on average 1.1904761904761905) internal successors, (125), 106 states have internal predecessors, (125), 27 states have call successors, (27), 11 states have call predecessors, (27), 12 states have return successors, (34), 27 states have call predecessors, (34), 26 states have call successors, (34) [2024-11-05 08:17:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 186 transitions. [2024-11-05 08:17:51,628 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 186 transitions. Word has length 110 [2024-11-05 08:17:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:51,628 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 186 transitions. [2024-11-05 08:17:51,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-05 08:17:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 186 transitions. [2024-11-05 08:17:51,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-05 08:17:51,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:51,629 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1] [2024-11-05 08:17:51,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:51,830 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:17:51,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:51,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:51,830 INFO L85 PathProgramCache]: Analyzing trace with hash 284996604, now seen corresponding path program 2 times [2024-11-05 08:17:51,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:51,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1585782757] [2024-11-05 08:17:51,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:51,831 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:17:51,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:51,834 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:17:51,835 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:17:52,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:52,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-05 08:17:52,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:53,396 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 50 proven. 2 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-05 08:17:53,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:55,067 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:17:55,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-05 08:17:55,078 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-05 08:17:55,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2024-11-05 08:17:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-05 08:17:55,120 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:55,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1585782757] [2024-11-05 08:17:55,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1585782757] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:17:55,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:17:55,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 19 [2024-11-05 08:17:55,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300061774] [2024-11-05 08:17:55,121 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:17:55,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 08:17:55,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:55,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 08:17:55,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:17:55,122 INFO L87 Difference]: Start difference. First operand 145 states and 186 transitions. Second operand has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-05 08:17:59,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:18:03,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:18:07,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:18:11,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:18:16,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:16,065 INFO L93 Difference]: Finished difference Result 274 states and 346 transitions. [2024-11-05 08:18:16,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-05 08:18:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) Word has length 111 [2024-11-05 08:18:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:16,068 INFO L225 Difference]: With dead ends: 274 [2024-11-05 08:18:16,068 INFO L226 Difference]: Without dead ends: 187 [2024-11-05 08:18:16,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 195 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2024-11-05 08:18:16,070 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 173 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 77 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:16,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 953 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 619 Invalid, 4 Unknown, 0 Unchecked, 20.0s Time] [2024-11-05 08:18:16,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-05 08:18:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2024-11-05 08:18:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 134 states have (on average 1.1791044776119404) internal successors, (158), 136 states have internal predecessors, (158), 28 states have call successors, (28), 15 states have call predecessors, (28), 17 states have return successors, (35), 28 states have call predecessors, (35), 27 states have call successors, (35) [2024-11-05 08:18:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 221 transitions. [2024-11-05 08:18:16,095 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 221 transitions. Word has length 111 [2024-11-05 08:18:16,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:16,095 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 221 transitions. [2024-11-05 08:18:16,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.944444444444445) internal successors, (89), 18 states have internal predecessors, (89), 8 states have call successors, (25), 5 states have call predecessors, (25), 6 states have return successors, (22), 7 states have call predecessors, (22), 7 states have call successors, (22) [2024-11-05 08:18:16,096 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 221 transitions. [2024-11-05 08:18:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-05 08:18:16,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:16,097 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 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, 1, 1, 1, 1, 1] [2024-11-05 08:18:16,109 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:18:16,297 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:18:16,298 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:16,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash -524350022, now seen corresponding path program 1 times [2024-11-05 08:18:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:16,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1523987899] [2024-11-05 08:18:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:16,298 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:18:16,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:16,300 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:18:16,301 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:18:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:16,495 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-05 08:18:16,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:16,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-05 08:18:16,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-05 08:18:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-05 08:18:19,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:20,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:18:20,288 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 334 treesize of output 327 [2024-11-05 08:18:20,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 156 [2024-11-05 08:18:20,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-05 08:18:20,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-05 08:18:20,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-05 08:18:20,821 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-05 08:18:20,821 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:20,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1523987899] [2024-11-05 08:18:20,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1523987899] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:18:20,821 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:18:20,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 21 [2024-11-05 08:18:20,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186480595] [2024-11-05 08:18:20,822 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:20,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-05 08:18:20,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:20,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-05 08:18:20,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=355, Unknown=0, NotChecked=0, Total=420 [2024-11-05 08:18:20,823 INFO L87 Difference]: Start difference. First operand 180 states and 221 transitions. Second operand has 21 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 19 states have internal predecessors, (104), 9 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-05 08:18:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:24,706 INFO L93 Difference]: Finished difference Result 445 states and 553 transitions. [2024-11-05 08:18:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-05 08:18:24,707 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 19 states have internal predecessors, (104), 9 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) Word has length 111 [2024-11-05 08:18:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:24,709 INFO L225 Difference]: With dead ends: 445 [2024-11-05 08:18:24,709 INFO L226 Difference]: Without dead ends: 350 [2024-11-05 08:18:24,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 190 SyntacticMatches, 12 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2024-11-05 08:18:24,712 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 110 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:24,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 795 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-05 08:18:24,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-05 08:18:24,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 194. [2024-11-05 08:18:24,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 143 states have (on average 1.1608391608391608) internal successors, (166), 146 states have internal predecessors, (166), 31 states have call successors, (31), 17 states have call predecessors, (31), 19 states have return successors, (38), 30 states have call predecessors, (38), 30 states have call successors, (38) [2024-11-05 08:18:24,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 235 transitions. [2024-11-05 08:18:24,743 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 235 transitions. Word has length 111 [2024-11-05 08:18:24,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:24,743 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 235 transitions. [2024-11-05 08:18:24,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 4.9523809523809526) internal successors, (104), 19 states have internal predecessors, (104), 9 states have call successors, (25), 5 states have call predecessors, (25), 4 states have return successors, (22), 9 states have call predecessors, (22), 8 states have call successors, (22) [2024-11-05 08:18:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 235 transitions. [2024-11-05 08:18:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-05 08:18:24,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:24,745 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:24,756 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 (15)] Ended with exit code 0 [2024-11-05 08:18:24,945 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:18:24,945 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:24,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:24,946 INFO L85 PathProgramCache]: Analyzing trace with hash -917377032, now seen corresponding path program 1 times [2024-11-05 08:18:24,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:24,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [917793139] [2024-11-05 08:18:24,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:24,946 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:18:24,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:24,947 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:18:24,948 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:18:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:25,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-05 08:18:25,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 47 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-11-05 08:18:28,531 INFO L311 TraceCheckSpWp]: Computing backward predicates...