/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_init_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:17:03,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:17:03,449 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:17:03,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:17:03,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:17:03,473 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:17:03,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:17:03,474 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:17:03,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:17:03,474 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:17:03,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:17:03,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:17:03,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:17:03,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:17:03,476 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:17:03,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:17:03,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:17:03,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:17:03,477 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:17:03,477 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:17:03,479 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:17:03,480 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:17:03,480 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:17:03,480 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:17:03,481 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:17:03,481 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:17:03,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:17:03,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:17:03,481 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:17:03,482 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:17:03,482 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:17:03,482 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:17:03,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:17:03,482 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:17:03,483 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:17:03,483 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:17:03,486 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:17:03,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:17:03,486 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:17:03,486 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:17:03,486 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:17:03,487 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:17:03,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:17:03,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:17:03,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:17:03,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:17:03,703 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:17:03,704 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_init_harness.i [2024-11-05 08:17:04,997 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:17:05,270 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:17:05,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_init_harness.i [2024-11-05 08:17:05,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb26b7a0/bd9ee4940fb04e0a80cc9f753fc8dd8e/FLAG674900e3a [2024-11-05 08:17:05,302 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bb26b7a0/bd9ee4940fb04e0a80cc9f753fc8dd8e [2024-11-05 08:17:05,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:17:05,304 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:17:05,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:17:05,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:17:05,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:17:05,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:17:05" (1/1) ... [2024-11-05 08:17:05,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2816bfd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:05, skipping insertion in model container [2024-11-05 08:17:05,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:17:05" (1/1) ... [2024-11-05 08:17:05,377 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:17:05,578 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_init_harness.i[4494,4507] [2024-11-05 08:17:05,583 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_init_harness.i[4554,4567] [2024-11-05 08:17:05,996 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:17:06,062 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:17:06,063 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:17:06,065 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:17:06,072 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:17:06,076 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,076 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,076 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,077 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:17:06,077 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,078 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,081 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:17:06,081 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:17:06,082 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:17:06,083 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:17:06,088 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,089 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:17:06,089 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,089 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:17:06,090 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,091 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:17:06,091 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,091 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:17:06,092 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,093 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:17:06,093 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,093 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:17:06,094 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,094 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,348 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:17:06,348 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:17:06,349 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:17:06,349 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:17:06,517 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:17:06,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:17:06,552 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 08:17:06,586 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:17:06,591 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_init_harness.i[4494,4507] [2024-11-05 08:17:06,592 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_init_harness.i[4554,4567] [2024-11-05 08:17:06,622 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:17:06,638 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:17:06,638 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:17:06,638 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:17:06,645 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:17:06,646 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,650 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,651 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,651 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:17:06,651 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,652 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,653 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:17:06,653 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:17:06,654 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:17:06,654 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:17:06,656 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,657 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:17:06,657 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,657 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:17:06,658 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,658 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:17:06,658 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,658 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:17:06,659 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,659 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:17:06,659 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,659 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:17:06,659 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,660 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,690 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:17:06,690 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:17:06,690 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:17:06,691 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:17:06,719 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:17:06,728 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:17:06,735 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:17:06,749 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_init_harness.i[4494,4507] [2024-11-05 08:17:06,749 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_init_harness.i[4554,4567] [2024-11-05 08:17:06,791 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,795 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,795 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,796 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,796 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,805 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,805 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,806 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,806 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,806 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,807 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,807 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,809 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:17:06,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:17:07,002 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 08:17:07,010 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:17:07,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07 WrapperNode [2024-11-05 08:17:07,011 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:17:07,013 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:17:07,013 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:17:07,013 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:17:07,020 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:17:07" (1/1) ... [2024-11-05 08:17:07,074 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:17:07" (1/1) ... [2024-11-05 08:17:07,101 INFO L138 Inliner]: procedures = 687, calls = 1034, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 93 [2024-11-05 08:17:07,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:17:07,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:17:07,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:17:07,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:17:07,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (1/1) ... [2024-11-05 08:17:07,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (1/1) ... [2024-11-05 08:17:07,113 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (1/1) ... [2024-11-05 08:17:07,134 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 5, 13]. 65 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 4 writes are split as follows [0, 0, 4]. [2024-11-05 08:17:07,134 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (1/1) ... [2024-11-05 08:17:07,134 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (1/1) ... [2024-11-05 08:17:07,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (1/1) ... [2024-11-05 08:17:07,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (1/1) ... [2024-11-05 08:17:07,157 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (1/1) ... [2024-11-05 08:17:07,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (1/1) ... [2024-11-05 08:17:07,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:17:07,162 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:17:07,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:17:07,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:17:07,163 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (1/1) ... [2024-11-05 08:17:07,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:17:07,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:17:07,188 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:17:07,190 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:17:07,207 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2024-11-05 08:17:07,207 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2024-11-05 08:17:07,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:17:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:17:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:17:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:17:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 08:17:07,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 08:17:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:17:07,208 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:17:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-05 08:17:07,208 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-05 08:17:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:17:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 08:17:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 08:17:07,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 08:17:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:17:07,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:17:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-05 08:17:07,209 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-05 08:17:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:17:07,209 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:17:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:17:07,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 08:17:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 08:17:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 08:17:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 08:17:07,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 08:17:07,211 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 08:17:07,427 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:17:07,433 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:17:07,697 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-05 08:17:07,698 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:17:07,712 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:17:07,712 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-05 08:17:07,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:17:07 BoogieIcfgContainer [2024-11-05 08:17:07,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:17:07,717 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:17:07,717 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:17:07,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:17:07,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:17:05" (1/3) ... [2024-11-05 08:17:07,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f4bfab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:17:07, skipping insertion in model container [2024-11-05 08:17:07,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:17:07" (2/3) ... [2024-11-05 08:17:07,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8f4bfab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:17:07, skipping insertion in model container [2024-11-05 08:17:07,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:17:07" (3/3) ... [2024-11-05 08:17:07,722 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2024-11-05 08:17:07,734 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:17:07,735 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:17:07,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:17:07,791 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;@3a276073, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:17:07,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:17:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-05 08:17:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 08:17:07,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:07,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:07,805 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:07,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:07,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1017333715, now seen corresponding path program 1 times [2024-11-05 08:17:07,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:07,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1998216382] [2024-11-05 08:17:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:07,821 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:07,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:07,828 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:17:07,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 (2)] Waiting until timeout for monitored process [2024-11-05 08:17:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:08,008 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:17:08,017 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:08,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:08,047 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:08,066 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1998216382] [2024-11-05 08:17:08,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1998216382] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:08,066 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:08,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-05 08:17:08,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136242724] [2024-11-05 08:17:08,070 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:08,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:17:08,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:08,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:17:08,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:17:08,095 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 08:17:08,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:08,113 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2024-11-05 08:17:08,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:17:08,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2024-11-05 08:17:08,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:08,125 INFO L225 Difference]: With dead ends: 117 [2024-11-05 08:17:08,125 INFO L226 Difference]: Without dead ends: 56 [2024-11-05 08:17:08,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:17:08,130 INFO L432 NwaCegarLoop]: 75 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, 75 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:17:08,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:17:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-05 08:17:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-05 08:17:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-05 08:17:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-05 08:17:08,163 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2024-11-05 08:17:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:08,163 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-05 08:17:08,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-05 08:17:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-05 08:17:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 08:17:08,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:08,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:08,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:08,369 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:17:08,370 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:08,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1834982165, now seen corresponding path program 1 times [2024-11-05 08:17:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1285869227] [2024-11-05 08:17:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:08,371 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:08,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:08,377 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:17:08,382 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:17:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:08,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-05 08:17:08,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:08,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-05 08:17:08,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-05 08:17:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:09,313 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:09,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:09,671 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:09,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1285869227] [2024-11-05 08:17:09,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1285869227] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:09,671 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:09,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 6] imperfect sequences [] total 14 [2024-11-05 08:17:09,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926468857] [2024-11-05 08:17:09,672 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:09,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 08:17:09,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:09,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 08:17:09,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-05 08:17:09,674 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 14 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 08:17:10,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:10,219 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2024-11-05 08:17:10,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 08:17:10,220 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2024-11-05 08:17:10,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:10,223 INFO L225 Difference]: With dead ends: 114 [2024-11-05 08:17:10,223 INFO L226 Difference]: Without dead ends: 65 [2024-11-05 08:17:10,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:17:10,224 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:10,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 389 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-05 08:17:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-05 08:17:10,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-05 08:17:10,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 46 states have internal predecessors, (57), 10 states have call successors, (10), 7 states have call predecessors, (10), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-05 08:17:10,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2024-11-05 08:17:10,235 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 26 [2024-11-05 08:17:10,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:10,235 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2024-11-05 08:17:10,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.0) internal successors, (33), 12 states have internal predecessors, (33), 6 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 08:17:10,236 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2024-11-05 08:17:10,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 08:17:10,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:10,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:10,242 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:10,437 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:10,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:10,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:10,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1650638505, now seen corresponding path program 1 times [2024-11-05 08:17:10,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:10,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2008627656] [2024-11-05 08:17:10,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:10,438 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,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:10,441 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:10,441 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:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:10,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-05 08:17:10,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:10,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-05 08:17:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:11,055 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:11,397 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:11,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2008627656] [2024-11-05 08:17:11,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2008627656] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:11,397 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:11,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 19 [2024-11-05 08:17:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133139176] [2024-11-05 08:17:11,398 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:11,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-05 08:17:11,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:11,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-05 08:17:11,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2024-11-05 08:17:11,399 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 19 states, 15 states have (on average 2.2) internal successors, (33), 16 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 08:17:12,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:12,040 INFO L93 Difference]: Finished difference Result 131 states and 168 transitions. [2024-11-05 08:17:12,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 08:17:12,041 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.2) internal successors, (33), 16 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2024-11-05 08:17:12,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:12,042 INFO L225 Difference]: With dead ends: 131 [2024-11-05 08:17:12,042 INFO L226 Difference]: Without dead ends: 79 [2024-11-05 08:17:12,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2024-11-05 08:17:12,043 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 129 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:12,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 616 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-05 08:17:12,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-05 08:17:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2024-11-05 08:17:12,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 55 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-05 08:17:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2024-11-05 08:17:12,059 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 26 [2024-11-05 08:17:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:12,059 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2024-11-05 08:17:12,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.2) internal successors, (33), 16 states have internal predecessors, (33), 7 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 08:17:12,060 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2024-11-05 08:17:12,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 08:17:12,060 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:12,061 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:12,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 08:17:12,261 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:12,261 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:12,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:12,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1257611495, now seen corresponding path program 1 times [2024-11-05 08:17:12,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:12,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [24635196] [2024-11-05 08:17:12,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:12,265 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:12,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:12,271 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:12,272 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:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:12,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-05 08:17:12,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:12,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-05 08:17:12,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 7 [2024-11-05 08:17:13,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:13,111 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:13,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:13,426 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:13,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [24635196] [2024-11-05 08:17:13,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [24635196] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:13,426 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:13,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 7] imperfect sequences [] total 16 [2024-11-05 08:17:13,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498910522] [2024-11-05 08:17:13,427 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:13,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:17:13,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:13,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:17:13,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:17:13,428 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 16 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 6 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 08:17:14,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:14,248 INFO L93 Difference]: Finished difference Result 158 states and 211 transitions. [2024-11-05 08:17:14,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-05 08:17:14,249 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 6 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 26 [2024-11-05 08:17:14,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:14,252 INFO L225 Difference]: With dead ends: 158 [2024-11-05 08:17:14,252 INFO L226 Difference]: Without dead ends: 96 [2024-11-05 08:17:14,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2024-11-05 08:17:14,253 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 112 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:14,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 460 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-05 08:17:14,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-05 08:17:14,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 77. [2024-11-05 08:17:14,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 57 states have (on average 1.368421052631579) internal successors, (78), 59 states have internal predecessors, (78), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-05 08:17:14,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 100 transitions. [2024-11-05 08:17:14,285 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 100 transitions. Word has length 26 [2024-11-05 08:17:14,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:14,285 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 100 transitions. [2024-11-05 08:17:14,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.5384615384615383) internal successors, (33), 14 states have internal predecessors, (33), 6 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-05 08:17:14,285 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 100 transitions. [2024-11-05 08:17:14,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 08:17:14,286 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:14,286 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:14,292 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:14,486 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:14,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:14,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:14,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1515776933, now seen corresponding path program 1 times [2024-11-05 08:17:14,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:14,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [383917870] [2024-11-05 08:17:14,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:14,487 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:14,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:14,490 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:14,490 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:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:14,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-05 08:17:14,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:14,618 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 38 treesize of output 17 [2024-11-05 08:17:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:15,020 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:15,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:15,198 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [383917870] [2024-11-05 08:17:15,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [383917870] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:15,198 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:15,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 16 [2024-11-05 08:17:15,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026780383] [2024-11-05 08:17:15,198 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:15,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:17:15,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:15,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:17:15,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-05 08:17:15,199 INFO L87 Difference]: Start difference. First operand 77 states and 100 transitions. Second operand has 16 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-05 08:17:16,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:16,208 INFO L93 Difference]: Finished difference Result 180 states and 245 transitions. [2024-11-05 08:17:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 08:17:16,208 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 26 [2024-11-05 08:17:16,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:16,214 INFO L225 Difference]: With dead ends: 180 [2024-11-05 08:17:16,214 INFO L226 Difference]: Without dead ends: 114 [2024-11-05 08:17:16,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=91, Invalid=371, Unknown=0, NotChecked=0, Total=462 [2024-11-05 08:17:16,215 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 101 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:16,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 590 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-05 08:17:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-05 08:17:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 81. [2024-11-05 08:17:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 63 states have internal predecessors, (84), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-05 08:17:16,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 106 transitions. [2024-11-05 08:17:16,245 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 106 transitions. Word has length 26 [2024-11-05 08:17:16,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:16,245 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 106 transitions. [2024-11-05 08:17:16,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-05 08:17:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 106 transitions. [2024-11-05 08:17:16,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-05 08:17:16,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:16,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:16,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-05 08:17:16,447 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:16,447 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:16,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash 504659683, now seen corresponding path program 1 times [2024-11-05 08:17:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:16,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1073809290] [2024-11-05 08:17:16,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:16,448 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:16,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:16,453 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:16,455 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:16,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:16,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:17:16,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:16,643 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:16,693 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:16,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1073809290] [2024-11-05 08:17:16,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1073809290] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:16,693 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:16,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2024-11-05 08:17:16,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630097192] [2024-11-05 08:17:16,694 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:16,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:17:16,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:16,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:17:16,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:17:16,695 INFO L87 Difference]: Start difference. First operand 81 states and 106 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:16,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:16,766 INFO L93 Difference]: Finished difference Result 177 states and 242 transitions. [2024-11-05 08:17:16,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:17:16,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-05 08:17:16,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:16,768 INFO L225 Difference]: With dead ends: 177 [2024-11-05 08:17:16,768 INFO L226 Difference]: Without dead ends: 74 [2024-11-05 08:17:16,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:17:16,770 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 22 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:16,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 460 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:17:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-05 08:17:16,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-05 08:17:16,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.3333333333333333) internal successors, (72), 56 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-05 08:17:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2024-11-05 08:17:16,787 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 26 [2024-11-05 08:17:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:16,787 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2024-11-05 08:17:16,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:16,789 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2024-11-05 08:17:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-05 08:17:16,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:16,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:16,797 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:16,995 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:16,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:16,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:16,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1687611897, now seen corresponding path program 1 times [2024-11-05 08:17:16,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:16,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [727368933] [2024-11-05 08:17:16,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:16,996 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:16,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:16,998 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:16,999 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:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:17,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:17:17,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:17,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:17,142 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:17,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:17,220 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:17,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [727368933] [2024-11-05 08:17:17,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [727368933] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:17,220 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:17,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 10 [2024-11-05 08:17:17,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645980686] [2024-11-05 08:17:17,220 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:17,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-05 08:17:17,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:17,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-05 08:17:17,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:17:17,221 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:17,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:17,373 INFO L93 Difference]: Finished difference Result 149 states and 189 transitions. [2024-11-05 08:17:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:17:17,374 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2024-11-05 08:17:17,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:17,374 INFO L225 Difference]: With dead ends: 149 [2024-11-05 08:17:17,374 INFO L226 Difference]: Without dead ends: 80 [2024-11-05 08:17:17,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 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:17,375 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 25 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:17,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 364 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:17:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-05 08:17:17,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 74. [2024-11-05 08:17:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.2962962962962963) internal successors, (70), 56 states have internal predecessors, (70), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-05 08:17:17,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2024-11-05 08:17:17,386 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 28 [2024-11-05 08:17:17,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:17,386 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2024-11-05 08:17:17,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2024-11-05 08:17:17,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-05 08:17:17,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:17,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:17,397 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:17,587 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:17,587 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:17,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1850407916, now seen corresponding path program 1 times [2024-11-05 08:17:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:17,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1576944750] [2024-11-05 08:17:17,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:17,588 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:17,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:17,591 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:17,592 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:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:17,681 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:17:17,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:17,748 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:17,853 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:17,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1576944750] [2024-11-05 08:17:17,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1576944750] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:17,853 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:17,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 12 [2024-11-05 08:17:17,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868102172] [2024-11-05 08:17:17,853 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:17,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 08:17:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:17,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 08:17:17,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-05 08:17:17,854 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:18,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:18,052 INFO L93 Difference]: Finished difference Result 161 states and 205 transitions. [2024-11-05 08:17:18,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-05 08:17:18,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-05 08:17:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:18,054 INFO L225 Difference]: With dead ends: 161 [2024-11-05 08:17:18,054 INFO L226 Difference]: Without dead ends: 90 [2024-11-05 08:17:18,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 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:18,055 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 43 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:18,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 441 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:17:18,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-05 08:17:18,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 76. [2024-11-05 08:17:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.2857142857142858) internal successors, (72), 58 states have internal predecessors, (72), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-05 08:17:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2024-11-05 08:17:18,067 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 30 [2024-11-05 08:17:18,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:18,067 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2024-11-05 08:17:18,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 11 states have internal predecessors, (35), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-05 08:17:18,067 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2024-11-05 08:17:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-05 08:17:18,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:18,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:18,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-05 08:17:18,270 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:18,271 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:18,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:18,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1395309347, now seen corresponding path program 1 times [2024-11-05 08:17:18,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:18,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [374547307] [2024-11-05 08:17:18,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:18,271 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:18,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:18,274 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:18,275 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:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:18,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:17:18,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:18,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:18,427 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:18,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:18,448 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:18,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [374547307] [2024-11-05 08:17:18,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [374547307] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:18,448 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:18,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 3] imperfect sequences [] total 9 [2024-11-05 08:17:18,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994032066] [2024-11-05 08:17:18,448 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:18,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-05 08:17:18,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:18,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-05 08:17:18,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:17:18,450 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:18,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:18,620 INFO L93 Difference]: Finished difference Result 155 states and 199 transitions. [2024-11-05 08:17:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:17:18,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2024-11-05 08:17:18,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:18,621 INFO L225 Difference]: With dead ends: 155 [2024-11-05 08:17:18,621 INFO L226 Difference]: Without dead ends: 90 [2024-11-05 08:17:18,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:17:18,622 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:18,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 387 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:17:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-05 08:17:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 78. [2024-11-05 08:17:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 60 states have internal predecessors, (74), 11 states have call successors, (11), 7 states have call predecessors, (11), 8 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2024-11-05 08:17:18,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 96 transitions. [2024-11-05 08:17:18,634 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 96 transitions. Word has length 31 [2024-11-05 08:17:18,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:18,634 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 96 transitions. [2024-11-05 08:17:18,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 4 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 96 transitions. [2024-11-05 08:17:18,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-05 08:17:18,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:18,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:18,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-05 08:17:18,837 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:18,838 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:18,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1854431003, now seen corresponding path program 1 times [2024-11-05 08:17:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:18,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1306270415] [2024-11-05 08:17:18,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:18,839 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:18,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:18,841 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:18,842 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:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:18,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-05 08:17:18,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:19,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-05 08:17:19,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-05 08:17:20,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:20,382 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:21,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:21,806 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:21,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1306270415] [2024-11-05 08:17:21,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1306270415] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:21,806 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:21,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 11] imperfect sequences [] total 24 [2024-11-05 08:17:21,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372474818] [2024-11-05 08:17:21,806 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:21,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-05 08:17:21,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:21,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-05 08:17:21,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2024-11-05 08:17:21,807 INFO L87 Difference]: Start difference. First operand 78 states and 96 transitions. Second operand has 24 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 8 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-05 08:17:24,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:24,538 INFO L93 Difference]: Finished difference Result 168 states and 213 transitions. [2024-11-05 08:17:24,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-05 08:17:24,538 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 8 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 39 [2024-11-05 08:17:24,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:24,539 INFO L225 Difference]: With dead ends: 168 [2024-11-05 08:17:24,540 INFO L226 Difference]: Without dead ends: 101 [2024-11-05 08:17:24,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2024-11-05 08:17:24,541 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 53 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:24,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 694 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-05 08:17:24,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-05 08:17:24,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2024-11-05 08:17:24,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.278688524590164) internal successors, (78), 64 states have internal predecessors, (78), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2024-11-05 08:17:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 105 transitions. [2024-11-05 08:17:24,556 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 105 transitions. Word has length 39 [2024-11-05 08:17:24,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:24,556 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 105 transitions. [2024-11-05 08:17:24,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.619047619047619) internal successors, (55), 20 states have internal predecessors, (55), 8 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-05 08:17:24,556 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 105 transitions. [2024-11-05 08:17:24,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-05 08:17:24,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:24,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:24,564 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:24,760 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:24,761 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:24,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:24,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1596265565, now seen corresponding path program 1 times [2024-11-05 08:17:24,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:24,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1777365631] [2024-11-05 08:17:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:24,761 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:24,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:24,764 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:24,765 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:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:24,868 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-05 08:17:24,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:29,001 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3| (_ 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_3|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3| (_ BitVec 64))) (not (= (_ bv0 64) (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_3|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3|))))) is different from true [2024-11-05 08:17:29,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:29,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:30,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:30,346 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:30,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1777365631] [2024-11-05 08:17:30,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1777365631] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:30,347 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:30,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2024-11-05 08:17:30,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958387605] [2024-11-05 08:17:30,347 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:30,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-05 08:17:30,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-05 08:17:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=228, Unknown=1, NotChecked=30, Total=306 [2024-11-05 08:17:30,348 INFO L87 Difference]: Start difference. First operand 83 states and 105 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:34,961 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:39,390 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,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:39,764 INFO L93 Difference]: Finished difference Result 193 states and 256 transitions. [2024-11-05 08:17:39,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-05 08:17:39,765 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 39 [2024-11-05 08:17:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:39,766 INFO L225 Difference]: With dead ends: 193 [2024-11-05 08:17:39,766 INFO L226 Difference]: Without dead ends: 118 [2024-11-05 08:17:39,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=100, Invalid=455, Unknown=1, NotChecked=44, Total=600 [2024-11-05 08:17:39,767 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 43 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:39,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 573 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 2 Unknown, 133 Unchecked, 9.0s Time] [2024-11-05 08:17:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-05 08:17:39,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 99. [2024-11-05 08:17:39,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.28) internal successors, (96), 79 states have internal predecessors, (96), 13 states have call successors, (13), 8 states have call predecessors, (13), 10 states have return successors, (17), 11 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-05 08:17:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 126 transitions. [2024-11-05 08:17:39,786 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 126 transitions. Word has length 39 [2024-11-05 08:17:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:39,786 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 126 transitions. [2024-11-05 08:17:39,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 126 transitions. [2024-11-05 08:17:39,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-05 08:17:39,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:39,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:39,797 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:39,987 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:39,987 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:39,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:39,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1687584481, now seen corresponding path program 1 times [2024-11-05 08:17:39,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:39,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1694140404] [2024-11-05 08:17:39,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:39,988 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:39,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:39,990 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:39,991 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:40,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:40,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-05 08:17:40,101 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:40,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:40,198 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:40,378 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:40,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1694140404] [2024-11-05 08:17:40,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1694140404] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:40,378 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:40,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 14 [2024-11-05 08:17:40,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78175029] [2024-11-05 08:17:40,378 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:40,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 08:17:40,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:40,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 08:17:40,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-05 08:17:40,379 INFO L87 Difference]: Start difference. First operand 99 states and 126 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-05 08:17:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:40,652 INFO L93 Difference]: Finished difference Result 229 states and 310 transitions. [2024-11-05 08:17:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 08:17:40,653 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 39 [2024-11-05 08:17:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:40,654 INFO L225 Difference]: With dead ends: 229 [2024-11-05 08:17:40,654 INFO L226 Difference]: Without dead ends: 111 [2024-11-05 08:17:40,654 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-05 08:17:40,654 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 63 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:40,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 559 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:17:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-05 08:17:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 100. [2024-11-05 08:17:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 80 states have internal predecessors, (95), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (19), 11 states have call predecessors, (19), 13 states have call successors, (19) [2024-11-05 08:17:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 128 transitions. [2024-11-05 08:17:40,673 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 128 transitions. Word has length 39 [2024-11-05 08:17:40,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:40,673 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 128 transitions. [2024-11-05 08:17:40,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 5 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-05 08:17:40,674 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 128 transitions. [2024-11-05 08:17:40,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-05 08:17:40,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:40,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:40,681 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:40,878 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:40,879 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:40,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:40,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1045188466, now seen corresponding path program 1 times [2024-11-05 08:17:40,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:40,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [513188991] [2024-11-05 08:17:40,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:40,879 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:40,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:40,880 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:40,882 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:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:41,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-05 08:17:41,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:45,161 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_7| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_5| (_ BitVec 64))) (not (= (_ bv0 64) (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_7|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_5|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_7| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_5| (_ 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_7|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_5|))))) is different from true [2024-11-05 08:17:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:45,320 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:45,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:45,466 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:45,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [513188991] [2024-11-05 08:17:45,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [513188991] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:17:45,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:17:45,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2024-11-05 08:17:45,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721043679] [2024-11-05 08:17:45,467 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:17:45,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-05 08:17:45,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:45,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-05 08:17:45,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2024-11-05 08:17:45,468 INFO L87 Difference]: Start difference. First operand 100 states and 128 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:46,000 INFO L93 Difference]: Finished difference Result 208 states and 278 transitions. [2024-11-05 08:17:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-05 08:17:46,000 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-05 08:17:46,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:46,001 INFO L225 Difference]: With dead ends: 208 [2024-11-05 08:17:46,001 INFO L226 Difference]: Without dead ends: 119 [2024-11-05 08:17:46,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-11-05 08:17:46,002 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 17 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:46,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 522 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 160 Unchecked, 0.5s Time] [2024-11-05 08:17:46,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-05 08:17:46,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 103. [2024-11-05 08:17:46,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 82 states have internal predecessors, (99), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (16), 12 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-05 08:17:46,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 129 transitions. [2024-11-05 08:17:46,022 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 129 transitions. Word has length 41 [2024-11-05 08:17:46,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:46,022 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 129 transitions. [2024-11-05 08:17:46,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-05 08:17:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2024-11-05 08:17:46,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-05 08:17:46,023 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:46,023 INFO L215 NwaCegarLoop]: trace histogram [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:46,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-05 08:17:46,226 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:17:46,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:46,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:46,227 INFO L85 PathProgramCache]: Analyzing trace with hash 964483973, now seen corresponding path program 1 times [2024-11-05 08:17:46,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:46,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [27396012] [2024-11-05 08:17:46,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:46,227 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:46,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:46,229 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:17:46,230 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:17:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:46,373 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-05 08:17:46,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:46,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 08:17:46,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-05 08:17:46,486 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:46,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [27396012] [2024-11-05 08:17:46,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [27396012] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:46,486 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:46,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2024-11-05 08:17:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810194225] [2024-11-05 08:17:46,486 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:46,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-05 08:17:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:46,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-05 08:17:46,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-05 08:17:46,487 INFO L87 Difference]: Start difference. First operand 103 states and 129 transitions. Second operand has 14 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 08:17:46,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:46,559 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2024-11-05 08:17:46,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-05 08:17:46,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-05 08:17:46,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:46,560 INFO L225 Difference]: With dead ends: 119 [2024-11-05 08:17:46,560 INFO L226 Difference]: Without dead ends: 117 [2024-11-05 08:17:46,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-05 08:17:46,561 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:46,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 712 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:17:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-05 08:17:46,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 112. [2024-11-05 08:17:46,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.25) internal successors, (105), 89 states have internal predecessors, (105), 15 states have call successors, (15), 9 states have call predecessors, (15), 12 states have return successors, (19), 13 states have call predecessors, (19), 14 states have call successors, (19) [2024-11-05 08:17:46,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 139 transitions. [2024-11-05 08:17:46,581 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 139 transitions. Word has length 42 [2024-11-05 08:17:46,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:46,581 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 139 transitions. [2024-11-05 08:17:46,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.25) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-05 08:17:46,582 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2024-11-05 08:17:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-05 08:17:46,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:46,582 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-05 08:17:46,588 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:17:46,782 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:17:46,783 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:46,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:46,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1440497479, now seen corresponding path program 1 times [2024-11-05 08:17:46,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:46,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [113416615] [2024-11-05 08:17:46,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:46,783 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:46,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:46,786 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:17:46,787 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:17:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:46,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-05 08:17:46,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:46,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-05 08:17:46,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 15 [2024-11-05 08:17:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 08:17:47,997 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-05 08:17:48,657 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:48,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [113416615] [2024-11-05 08:17:48,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [113416615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:17:48,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:17:48,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-05 08:17:48,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036266662] [2024-11-05 08:17:48,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:17:48,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-05 08:17:48,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-05 08:17:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-11-05 08:17:48,658 INFO L87 Difference]: Start difference. First operand 112 states and 139 transitions. Second operand has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 10 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-05 08:17:49,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:49,801 INFO L93 Difference]: Finished difference Result 237 states and 299 transitions. [2024-11-05 08:17:49,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-05 08:17:49,802 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 10 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 50 [2024-11-05 08:17:49,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:49,804 INFO L225 Difference]: With dead ends: 237 [2024-11-05 08:17:49,804 INFO L226 Difference]: Without dead ends: 136 [2024-11-05 08:17:49,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-11-05 08:17:49,806 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 95 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:49,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 456 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-05 08:17:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-05 08:17:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 104. [2024-11-05 08:17:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.240506329113924) internal successors, (98), 83 states have internal predecessors, (98), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-05 08:17:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2024-11-05 08:17:49,830 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 50 [2024-11-05 08:17:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:49,832 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2024-11-05 08:17:49,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 10 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-05 08:17:49,832 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2024-11-05 08:17:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-05 08:17:49,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:49,832 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:49,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-05 08:17:50,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:17:50,037 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:50,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:50,037 INFO L85 PathProgramCache]: Analyzing trace with hash -41969126, now seen corresponding path program 1 times [2024-11-05 08:17:50,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:50,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2011933810] [2024-11-05 08:17:50,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:50,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:17:50,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:50,040 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:17:50,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-05 08:17:50,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:50,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-05 08:17:50,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-05 08:17:50,914 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:51,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:17:51,502 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 28 treesize of output 31 [2024-11-05 08:17:51,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-05 08:17:51,523 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 22 treesize of output 25 [2024-11-05 08:17:51,635 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-05 08:17:51,636 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:51,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2011933810] [2024-11-05 08:17:51,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2011933810] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:17:51,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:17:51,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13] total 24 [2024-11-05 08:17:51,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581808084] [2024-11-05 08:17:51,636 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:17:51,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-05 08:17:51,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:51,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-05 08:17:51,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=492, Unknown=0, NotChecked=0, Total=552 [2024-11-05 08:17:51,639 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 24 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 19 states have internal predecessors, (59), 10 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-05 08:17:53,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:53,972 INFO L93 Difference]: Finished difference Result 188 states and 236 transitions. [2024-11-05 08:17:53,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-05 08:17:53,973 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 19 states have internal predecessors, (59), 10 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) Word has length 58 [2024-11-05 08:17:53,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:53,975 INFO L225 Difference]: With dead ends: 188 [2024-11-05 08:17:53,975 INFO L226 Difference]: Without dead ends: 138 [2024-11-05 08:17:53,975 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 92 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=176, Invalid=1384, Unknown=0, NotChecked=0, Total=1560 [2024-11-05 08:17:53,976 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 147 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:53,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 701 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-05 08:17:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-05 08:17:54,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2024-11-05 08:17:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 96 states have (on average 1.1875) internal successors, (114), 98 states have internal predecessors, (114), 14 states have call successors, (14), 11 states have call predecessors, (14), 11 states have return successors, (15), 12 states have call predecessors, (15), 13 states have call successors, (15) [2024-11-05 08:17:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2024-11-05 08:17:54,006 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 58 [2024-11-05 08:17:54,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:54,006 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2024-11-05 08:17:54,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 2.8095238095238093) internal successors, (59), 19 states have internal predecessors, (59), 10 states have call successors, (15), 5 states have call predecessors, (15), 5 states have return successors, (11), 9 states have call predecessors, (11), 7 states have call successors, (11) [2024-11-05 08:17:54,006 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2024-11-05 08:17:54,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-05 08:17:54,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:54,007 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:54,016 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 (17)] Ended with exit code 0 [2024-11-05 08:17:54,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:17:54,212 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:54,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:54,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1239716043, now seen corresponding path program 1 times [2024-11-05 08:17:54,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:54,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [731885143] [2024-11-05 08:17:54,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:54,212 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:54,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:54,213 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:17:54,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-05 08:17:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:54,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-05 08:17:54,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:17:54,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:17:54,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:17:54,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:17:54,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2024-11-05 08:17:54,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:17:54,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:17:54,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:17:54,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 19 [2024-11-05 08:17:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-05 08:17:56,847 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:17:57,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 598 treesize of output 586 [2024-11-05 08:17:57,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-05 08:17:57,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-05 08:17:57,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 398 treesize of output 374 [2024-11-05 08:17:57,748 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-05 08:17:57,748 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:17:57,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [731885143] [2024-11-05 08:17:57,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [731885143] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-05 08:17:57,748 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-05 08:17:57,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 8] imperfect sequences [] total 17 [2024-11-05 08:17:57,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476615648] [2024-11-05 08:17:57,749 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-05 08:17:57,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-05 08:17:57,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:17:57,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-05 08:17:57,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-05 08:17:57,750 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand has 17 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 10 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 8 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-05 08:17:59,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:17:59,436 INFO L93 Difference]: Finished difference Result 144 states and 164 transitions. [2024-11-05 08:17:59,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-05 08:17:59,437 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 10 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 8 states have call predecessors, (17), 9 states have call successors, (17) Word has length 78 [2024-11-05 08:17:59,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:17:59,438 INFO L225 Difference]: With dead ends: 144 [2024-11-05 08:17:59,438 INFO L226 Difference]: Without dead ends: 137 [2024-11-05 08:17:59,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 137 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2024-11-05 08:17:59,438 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 52 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-05 08:17:59,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 632 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-05 08:17:59,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-05 08:17:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 121. [2024-11-05 08:17:59,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 95 states have (on average 1.1473684210526316) internal successors, (109), 97 states have internal predecessors, (109), 13 states have call successors, (13), 12 states have call predecessors, (13), 12 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2024-11-05 08:17:59,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 135 transitions. [2024-11-05 08:17:59,468 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 135 transitions. Word has length 78 [2024-11-05 08:17:59,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:17:59,468 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 135 transitions. [2024-11-05 08:17:59,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 10 states have call successors, (18), 4 states have call predecessors, (18), 6 states have return successors, (17), 8 states have call predecessors, (17), 9 states have call successors, (17) [2024-11-05 08:17:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 135 transitions. [2024-11-05 08:17:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-05 08:17:59,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:17:59,469 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:17:59,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-05 08:17:59,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:17:59,674 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:17:59,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:17:59,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2049062669, now seen corresponding path program 1 times [2024-11-05 08:17:59,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:17:59,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1442050863] [2024-11-05 08:17:59,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:17:59,674 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:59,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:17:59,676 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:17:59,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-05 08:17:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:17:59,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-05 08:17:59,830 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:33,495 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_14|) (bvadd (_ bv24 64) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_14|))))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_14| (_ BitVec 64)) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_14|) (bvadd (_ bv24 64) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_14|)))))) is different from true