/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_pop_back_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-05 08:18:09,307 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-05 08:18:09,384 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-05 08:18:09,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-05 08:18:09,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-05 08:18:09,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-05 08:18:09,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-05 08:18:09,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-05 08:18:09,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-05 08:18:09,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-05 08:18:09,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-05 08:18:09,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-05 08:18:09,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-05 08:18:09,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-05 08:18:09,416 INFO L153 SettingsManager]: * Use SBE=true [2024-11-05 08:18:09,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-05 08:18:09,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-05 08:18:09,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-05 08:18:09,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-05 08:18:09,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-05 08:18:09,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-05 08:18:09,422 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-05 08:18:09,422 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-05 08:18:09,422 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-05 08:18:09,422 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-05 08:18:09,423 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-05 08:18:09,423 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-05 08:18:09,426 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-05 08:18:09,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-05 08:18:09,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-05 08:18:09,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-05 08:18:09,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:18:09,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-05 08:18:09,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-05 08:18:09,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-05 08:18:09,428 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-05 08:18:09,428 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-05 08:18:09,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-05 08:18:09,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-05 08:18:09,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-05 08:18:09,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-05 08:18:09,430 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:09,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-05 08:18:09,683 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-05 08:18:09,687 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-05 08:18:09,688 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-05 08:18:09,689 INFO L274 PluginConnector]: CDTParser initialized [2024-11-05 08:18:09,690 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_pop_back_harness.i [2024-11-05 08:18:11,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-05 08:18:11,609 INFO L384 CDTParser]: Found 1 translation units. [2024-11-05 08:18:11,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_pop_back_harness.i [2024-11-05 08:18:11,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9798113/d2e6a2c6c14046b3a07a500cc5f8d8f5/FLAGe0843418d [2024-11-05 08:18:11,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f9798113/d2e6a2c6c14046b3a07a500cc5f8d8f5 [2024-11-05 08:18:11,749 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-05 08:18:11,751 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-05 08:18:11,752 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-05 08:18:11,753 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-05 08:18:11,759 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-05 08:18:11,760 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:18:11" (1/1) ... [2024-11-05 08:18:11,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f04360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:11, skipping insertion in model container [2024-11-05 08:18:11,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.11 08:18:11" (1/1) ... [2024-11-05 08:18:11,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:18:12,186 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_pop_back_harness.i[4498,4511] [2024-11-05 08:18:12,196 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_pop_back_harness.i[4558,4571] [2024-11-05 08:18:13,251 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,350 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,351 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,352 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,362 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,364 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,365 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,366 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,366 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,367 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,368 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,370 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,371 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,373 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,375 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,386 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,387 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,387 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,388 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,389 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,390 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,390 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,390 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,392 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,393 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,393 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,393 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,394 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,394 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:13,745 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,745 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,750 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,750 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,897 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:13,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:13,949 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-05 08:18:13,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-05 08:18:13,982 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_pop_back_harness.i[4498,4511] [2024-11-05 08:18:13,982 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_pop_back_harness.i[4558,4571] [2024-11-05 08:18:14,015 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,033 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,034 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,034 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,041 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,041 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,042 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,042 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,046 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,046 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,046 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,048 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,048 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,049 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,053 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,057 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,057 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,058 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,059 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,060 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,060 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,060 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,060 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,061 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,061 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,061 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,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:18:14,062 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,063 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,115 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,115 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,115 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,116 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,155 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-05 08:18:14,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:14,173 INFO L200 MainTranslator]: Completed pre-run [2024-11-05 08:18:14,188 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_pop_back_harness.i[4498,4511] [2024-11-05 08:18:14,188 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_pop_back_harness.i[4558,4571] [2024-11-05 08:18:14,234 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,234 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,234 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,235 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,235 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,241 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,243 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,244 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,244 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,246 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,247 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,247 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,247 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-05 08:18:14,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-05 08:18:14,514 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-05 08:18:14,525 INFO L204 MainTranslator]: Completed translation [2024-11-05 08:18:14,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14 WrapperNode [2024-11-05 08:18:14,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-05 08:18:14,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-05 08:18:14,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-05 08:18:14,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-05 08:18:14,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,606 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,667 INFO L138 Inliner]: procedures = 687, calls = 1044, calls flagged for inlining = 52, calls inlined = 8, statements flattened = 227 [2024-11-05 08:18:14,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-05 08:18:14,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-05 08:18:14,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-05 08:18:14,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-05 08:18:14,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,720 INFO L175 MemorySlicer]: Split 43 memory accesses to 3 slices as follows [2, 5, 36]. 84 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 9 writes are split as follows [0, 0, 9]. [2024-11-05 08:18:14,721 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,721 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,750 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,754 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,763 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-05 08:18:14,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-05 08:18:14,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-05 08:18:14,775 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-05 08:18:14,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (1/1) ... [2024-11-05 08:18:14,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-05 08:18:14,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-05 08:18:14,805 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:18:14,811 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:18:14,836 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_mem_zeroed [2024-11-05 08:18:14,837 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_mem_zeroed [2024-11-05 08:18:14,837 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_remove [2024-11-05 08:18:14,837 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_remove [2024-11-05 08:18:14,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-05 08:18:14,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-05 08:18:14,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-05 08:18:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-05 08:18:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-05 08:18:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-05 08:18:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:18:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-05 08:18:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-05 08:18:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-05 08:18:14,838 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-05 08:18:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-05 08:18:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-05 08:18:14,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-05 08:18:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-05 08:18:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-05 08:18:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-05 08:18:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-05 08:18:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-05 08:18:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-05 08:18:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2024-11-05 08:18:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2024-11-05 08:18:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-05 08:18:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-05 08:18:14,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-05 08:18:14,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-05 08:18:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-05 08:18:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-05 08:18:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-05 08:18:14,840 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-05 08:18:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-05 08:18:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-05 08:18:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-05 08:18:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-05 08:18:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-05 08:18:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-05 08:18:14,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-05 08:18:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-05 08:18:14,841 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-05 08:18:14,841 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-05 08:18:14,841 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-05 08:18:15,160 INFO L238 CfgBuilder]: Building ICFG [2024-11-05 08:18:15,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-05 08:18:15,811 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2024-11-05 08:18:15,811 INFO L287 CfgBuilder]: Performing block encoding [2024-11-05 08:18:15,827 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-05 08:18:15,828 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-05 08:18:15,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:18:15 BoogieIcfgContainer [2024-11-05 08:18:15,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-05 08:18:15,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-05 08:18:15,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-05 08:18:15,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-05 08:18:15,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.11 08:18:11" (1/3) ... [2024-11-05 08:18:15,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6214bc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:18:15, skipping insertion in model container [2024-11-05 08:18:15,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.11 08:18:14" (2/3) ... [2024-11-05 08:18:15,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6214bc10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.11 08:18:15, skipping insertion in model container [2024-11-05 08:18:15,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.11 08:18:15" (3/3) ... [2024-11-05 08:18:15,840 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_pop_back_harness.i [2024-11-05 08:18:15,856 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-05 08:18:15,856 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-05 08:18:15,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-05 08:18:15,932 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;@481488b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-05 08:18:15,932 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-05 08:18:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-05 08:18:15,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-05 08:18:15,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:15,949 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:15,949 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:15,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:15,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1634297944, now seen corresponding path program 1 times [2024-11-05 08:18:15,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:15,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [956570957] [2024-11-05 08:18:15,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:15,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:15,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:15,968 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:18:15,969 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:18:16,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:16,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-05 08:18:16,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-05 08:18:16,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:16,410 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-05 08:18:16,411 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:16,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [956570957] [2024-11-05 08:18:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [956570957] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:16,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:16,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-05 08:18:16,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949105270] [2024-11-05 08:18:16,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:16,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-05 08:18:16,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:16,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-05 08:18:16,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-05 08:18:16,445 INFO L87 Difference]: Start difference. First operand has 137 states, 89 states have (on average 1.303370786516854) internal successors, (116), 90 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:18:16,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:16,483 INFO L93 Difference]: Finished difference Result 266 states and 401 transitions. [2024-11-05 08:18:16,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-05 08:18:16,485 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-05 08:18:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:16,496 INFO L225 Difference]: With dead ends: 266 [2024-11-05 08:18:16,496 INFO L226 Difference]: Without dead ends: 132 [2024-11-05 08:18:16,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 230 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:18:16,504 INFO L432 NwaCegarLoop]: 183 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, 183 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:18:16,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:18:16,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-05 08:18:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2024-11-05 08:18:16,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 84 states have (on average 1.25) internal successors, (105), 85 states have internal predecessors, (105), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-05 08:18:16,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 178 transitions. [2024-11-05 08:18:16,566 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 178 transitions. Word has length 116 [2024-11-05 08:18:16,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:16,566 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 178 transitions. [2024-11-05 08:18:16,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:18:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 178 transitions. [2024-11-05 08:18:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-05 08:18:16,571 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:16,571 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:16,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-05 08:18:16,772 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:18:16,772 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:16,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:16,773 INFO L85 PathProgramCache]: Analyzing trace with hash 851280282, now seen corresponding path program 1 times [2024-11-05 08:18:16,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:16,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1843187043] [2024-11-05 08:18:16,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:16,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:16,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:16,775 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:18:16,777 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:18:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:17,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-05 08:18:17,068 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:17,094 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-05 08:18:17,095 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:17,197 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-05 08:18:17,197 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:17,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1843187043] [2024-11-05 08:18:17,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1843187043] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:17,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:17,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-05 08:18:17,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218355555] [2024-11-05 08:18:17,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:17,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-05 08:18:17,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:17,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-05 08:18:17,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:18:17,201 INFO L87 Difference]: Start difference. First operand 132 states and 178 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:18:17,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:17,249 INFO L93 Difference]: Finished difference Result 247 states and 338 transitions. [2024-11-05 08:18:17,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-05 08:18:17,252 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-05 08:18:17,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:17,254 INFO L225 Difference]: With dead ends: 247 [2024-11-05 08:18:17,254 INFO L226 Difference]: Without dead ends: 135 [2024-11-05 08:18:17,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-05 08:18:17,258 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 1 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:17,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:18:17,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-05 08:18:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2024-11-05 08:18:17,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 86 states have (on average 1.244186046511628) internal successors, (107), 87 states have internal predecessors, (107), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-05 08:18:17,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 180 transitions. [2024-11-05 08:18:17,285 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 180 transitions. Word has length 116 [2024-11-05 08:18:17,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:17,290 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 180 transitions. [2024-11-05 08:18:17,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:18:17,291 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 180 transitions. [2024-11-05 08:18:17,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-05 08:18:17,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:17,296 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:17,306 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:18:17,497 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:18:17,497 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:17,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash -911862316, now seen corresponding path program 1 times [2024-11-05 08:18:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:17,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1194584718] [2024-11-05 08:18:17,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:17,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:17,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:17,502 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:18:17,503 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:18:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:17,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:18:17,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:17,781 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-05 08:18:17,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2024-11-05 08:18:17,868 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:17,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1194584718] [2024-11-05 08:18:17,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1194584718] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:17,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:17,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-05 08:18:17,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001388866] [2024-11-05 08:18:17,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:17,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:18:17,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:17,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:18:17,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:18:17,870 INFO L87 Difference]: Start difference. First operand 134 states and 180 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:18:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:17,930 INFO L93 Difference]: Finished difference Result 251 states and 343 transitions. [2024-11-05 08:18:17,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:18:17,930 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 116 [2024-11-05 08:18:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:17,934 INFO L225 Difference]: With dead ends: 251 [2024-11-05 08:18:17,934 INFO L226 Difference]: Without dead ends: 137 [2024-11-05 08:18:17,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:18:17,938 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:17,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 684 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:18:17,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-05 08:18:17,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-05 08:18:17,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 89 states have (on average 1.2359550561797752) internal successors, (110), 90 states have internal predecessors, (110), 37 states have call successors, (37), 10 states have call predecessors, (37), 10 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-05 08:18:17,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 183 transitions. [2024-11-05 08:18:17,955 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 183 transitions. Word has length 116 [2024-11-05 08:18:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:17,956 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 183 transitions. [2024-11-05 08:18:17,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-05 08:18:17,957 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 183 transitions. [2024-11-05 08:18:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-05 08:18:17,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:17,958 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:17,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-05 08:18:18,166 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:18:18,167 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:18,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:18,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1271238514, now seen corresponding path program 1 times [2024-11-05 08:18:18,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:18,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [173405361] [2024-11-05 08:18:18,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:18,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:18,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:18,171 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:18:18,172 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:18:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:18,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-05 08:18:18,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:18,483 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-05 08:18:18,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:18,615 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-05 08:18:18,615 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:18,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [173405361] [2024-11-05 08:18:18,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [173405361] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:18,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:18,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 7 [2024-11-05 08:18:18,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232260547] [2024-11-05 08:18:18,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:18,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-05 08:18:18,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:18,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-05 08:18:18,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:18:18,617 INFO L87 Difference]: Start difference. First operand 137 states and 183 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-05 08:18:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:18,732 INFO L93 Difference]: Finished difference Result 256 states and 345 transitions. [2024-11-05 08:18:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-05 08:18:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 116 [2024-11-05 08:18:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:18,737 INFO L225 Difference]: With dead ends: 256 [2024-11-05 08:18:18,738 INFO L226 Difference]: Without dead ends: 139 [2024-11-05 08:18:18,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-05 08:18:18,743 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:18,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 807 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:18:18,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-11-05 08:18:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2024-11-05 08:18:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.2333333333333334) internal successors, (111), 92 states have internal predecessors, (111), 37 states have call successors, (37), 10 states have call predecessors, (37), 11 states have return successors, (40), 36 states have call predecessors, (40), 36 states have call successors, (40) [2024-11-05 08:18:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2024-11-05 08:18:18,763 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 116 [2024-11-05 08:18:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:18,767 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2024-11-05 08:18:18,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (16), 2 states have call predecessors, (16), 4 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-05 08:18:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2024-11-05 08:18:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-05 08:18:18,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:18,769 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:18,781 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:18:18,969 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:18:18,970 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:18,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash 383901392, now seen corresponding path program 1 times [2024-11-05 08:18:18,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:18,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1237107576] [2024-11-05 08:18:18,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:18,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:18,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:18,972 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:18:18,973 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:18:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:19,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-05 08:18:19,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:19,289 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-05 08:18:19,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-05 08:18:19,525 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:19,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1237107576] [2024-11-05 08:18:19,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1237107576] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:19,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:19,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 9 [2024-11-05 08:18:19,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106617816] [2024-11-05 08:18:19,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:19,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:18:19,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:19,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:18:19,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:18:19,527 INFO L87 Difference]: Start difference. First operand 139 states and 188 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-05 08:18:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:19,765 INFO L93 Difference]: Finished difference Result 263 states and 358 transitions. [2024-11-05 08:18:19,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:18:19,766 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 118 [2024-11-05 08:18:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:19,768 INFO L225 Difference]: With dead ends: 263 [2024-11-05 08:18:19,768 INFO L226 Difference]: Without dead ends: 144 [2024-11-05 08:18:19,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-05 08:18:19,770 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 46 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:19,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 873 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:18:19,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-05 08:18:19,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2024-11-05 08:18:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 95 states have internal predecessors, (113), 37 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2024-11-05 08:18:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 192 transitions. [2024-11-05 08:18:19,783 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 192 transitions. Word has length 118 [2024-11-05 08:18:19,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:19,783 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 192 transitions. [2024-11-05 08:18:19,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-05 08:18:19,784 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 192 transitions. [2024-11-05 08:18:19,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-05 08:18:19,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:19,785 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:19,794 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:18:19,985 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:18:19,986 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:19,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:19,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1545770691, now seen corresponding path program 1 times [2024-11-05 08:18:19,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:19,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [495349528] [2024-11-05 08:18:19,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:19,987 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:19,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:19,990 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:18:19,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 (7)] Waiting until timeout for monitored process [2024-11-05 08:18:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:20,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:18:20,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:20,318 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-11-05 08:18:20,319 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-05 08:18:20,565 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:20,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [495349528] [2024-11-05 08:18:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [495349528] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:20,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2024-11-05 08:18:20,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358432326] [2024-11-05 08:18:20,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:20,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-05 08:18:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-05 08:18:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-05 08:18:20,567 INFO L87 Difference]: Start difference. First operand 142 states and 192 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-05 08:18:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:20,867 INFO L93 Difference]: Finished difference Result 275 states and 376 transitions. [2024-11-05 08:18:20,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-05 08:18:20,870 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 120 [2024-11-05 08:18:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:20,873 INFO L225 Difference]: With dead ends: 275 [2024-11-05 08:18:20,873 INFO L226 Difference]: Without dead ends: 153 [2024-11-05 08:18:20,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2024-11-05 08:18:20,876 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 55 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:20,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1017 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:18:20,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-05 08:18:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 144. [2024-11-05 08:18:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 97 states have internal predecessors, (116), 37 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2024-11-05 08:18:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 195 transitions. [2024-11-05 08:18:20,899 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 195 transitions. Word has length 120 [2024-11-05 08:18:20,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:20,900 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 195 transitions. [2024-11-05 08:18:20,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-05 08:18:20,900 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 195 transitions. [2024-11-05 08:18:20,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-05 08:18:20,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:20,901 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:20,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-05 08:18:21,102 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:18:21,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:21,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:21,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1786998227, now seen corresponding path program 1 times [2024-11-05 08:18:21,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:21,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [406014244] [2024-11-05 08:18:21,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:21,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:21,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:21,105 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:18:21,105 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:18:21,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:21,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-05 08:18:21,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:21,501 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-05 08:18:21,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:21,608 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2024-11-05 08:18:21,608 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:21,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [406014244] [2024-11-05 08:18:21,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [406014244] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:21,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:21,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3] total 8 [2024-11-05 08:18:21,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595575422] [2024-11-05 08:18:21,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:21,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:18:21,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:21,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:18:21,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:18:21,611 INFO L87 Difference]: Start difference. First operand 144 states and 195 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-05 08:18:21,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:21,824 INFO L93 Difference]: Finished difference Result 275 states and 378 transitions. [2024-11-05 08:18:21,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:18:21,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) Word has length 121 [2024-11-05 08:18:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:21,826 INFO L225 Difference]: With dead ends: 275 [2024-11-05 08:18:21,827 INFO L226 Difference]: Without dead ends: 151 [2024-11-05 08:18:21,828 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-05 08:18:21,828 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 50 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:21,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 708 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-05 08:18:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-05 08:18:21,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 145. [2024-11-05 08:18:21,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 95 states have (on average 1.231578947368421) internal successors, (117), 98 states have internal predecessors, (117), 37 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2024-11-05 08:18:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 196 transitions. [2024-11-05 08:18:21,846 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 196 transitions. Word has length 121 [2024-11-05 08:18:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:21,848 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 196 transitions. [2024-11-05 08:18:21,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 4 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 4 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-05 08:18:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 196 transitions. [2024-11-05 08:18:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-05 08:18:21,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:21,851 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:21,861 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 (8)] Forceful destruction successful, exit code 0 [2024-11-05 08:18:22,054 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:18:22,055 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:22,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:22,055 INFO L85 PathProgramCache]: Analyzing trace with hash -203374091, now seen corresponding path program 1 times [2024-11-05 08:18:22,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:22,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2062850981] [2024-11-05 08:18:22,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:22,056 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:22,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:22,059 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:18:22,060 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:18:22,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:22,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-05 08:18:22,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-05 08:18:22,372 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:22,498 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-11-05 08:18:22,498 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:22,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2062850981] [2024-11-05 08:18:22,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2062850981] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:18:22,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:18:22,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 8 [2024-11-05 08:18:22,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301774320] [2024-11-05 08:18:22,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:18:22,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-05 08:18:22,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:22,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-05 08:18:22,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:18:22,500 INFO L87 Difference]: Start difference. First operand 145 states and 196 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-05 08:18:22,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:22,610 INFO L93 Difference]: Finished difference Result 276 states and 376 transitions. [2024-11-05 08:18:22,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-05 08:18:22,610 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 129 [2024-11-05 08:18:22,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:22,612 INFO L225 Difference]: With dead ends: 276 [2024-11-05 08:18:22,612 INFO L226 Difference]: Without dead ends: 151 [2024-11-05 08:18:22,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-05 08:18:22,614 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 965 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:22,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 965 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-05 08:18:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-05 08:18:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2024-11-05 08:18:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 96 states have (on average 1.2291666666666667) internal successors, (118), 99 states have internal predecessors, (118), 37 states have call successors, (37), 10 states have call predecessors, (37), 12 states have return successors, (42), 36 states have call predecessors, (42), 36 states have call successors, (42) [2024-11-05 08:18:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 197 transitions. [2024-11-05 08:18:22,630 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 197 transitions. Word has length 129 [2024-11-05 08:18:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:22,631 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 197 transitions. [2024-11-05 08:18:22,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 3 states have call successors, (17), 2 states have call predecessors, (17), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-05 08:18:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 197 transitions. [2024-11-05 08:18:22,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-05 08:18:22,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:22,632 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:22,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-05 08:18:22,832 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:18:22,833 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:22,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:22,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1018173218, now seen corresponding path program 1 times [2024-11-05 08:18:22,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:22,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1901834236] [2024-11-05 08:18:22,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:22,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:22,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:22,835 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:18:22,836 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:18:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:23,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-05 08:18:23,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:27,416 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2024-11-05 08:18:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 108 proven. 1 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-05 08:18:27,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-11-05 08:18:28,020 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:28,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1901834236] [2024-11-05 08:18:28,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1901834236] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:18:28,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:18:28,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2024-11-05 08:18:28,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410438231] [2024-11-05 08:18:28,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:18:28,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-05 08:18:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:28,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-05 08:18:28,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2024-11-05 08:18:28,023 INFO L87 Difference]: Start difference. First operand 146 states and 197 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 4 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-05 08:18:29,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:18:29,191 INFO L93 Difference]: Finished difference Result 310 states and 436 transitions. [2024-11-05 08:18:29,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-05 08:18:29,192 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 4 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 131 [2024-11-05 08:18:29,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:18:29,194 INFO L225 Difference]: With dead ends: 310 [2024-11-05 08:18:29,194 INFO L226 Difference]: Without dead ends: 184 [2024-11-05 08:18:29,195 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 245 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=74, Invalid=309, Unknown=1, NotChecked=36, Total=420 [2024-11-05 08:18:29,196 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 64 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 1234 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 355 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:18:29,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 1234 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 377 Invalid, 0 Unknown, 355 Unchecked, 1.0s Time] [2024-11-05 08:18:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-05 08:18:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 155. [2024-11-05 08:18:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 103 states have (on average 1.233009708737864) internal successors, (127), 106 states have internal predecessors, (127), 38 states have call successors, (38), 11 states have call predecessors, (38), 13 states have return successors, (44), 37 states have call predecessors, (44), 37 states have call successors, (44) [2024-11-05 08:18:29,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 209 transitions. [2024-11-05 08:18:29,210 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 209 transitions. Word has length 131 [2024-11-05 08:18:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:18:29,210 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 209 transitions. [2024-11-05 08:18:29,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.625) internal successors, (90), 16 states have internal predecessors, (90), 4 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2024-11-05 08:18:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 209 transitions. [2024-11-05 08:18:29,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-05 08:18:29,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:18:29,212 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:18:29,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-05 08:18:29,413 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:18:29,413 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:18:29,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:18:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash -335119218, now seen corresponding path program 1 times [2024-11-05 08:18:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:18:29,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1193756274] [2024-11-05 08:18:29,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:18:29,414 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:18:29,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:18:29,417 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:18:29,418 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:18:29,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:18:29,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-05 08:18:29,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:18:34,013 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv16 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_14|) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_14| (_ BitVec 64))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_14| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_14|) (_ bv0 64)))))) is different from true [2024-11-05 08:18:38,189 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_15| (_ BitVec 64))) (not (= (_ bv16 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_15|) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_15| (_ BitVec 64))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_15| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_15|) (_ bv0 64)))))) is different from true [2024-11-05 08:18:42,363 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (not (= (_ bv16 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_16|) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_16| (_ BitVec 64))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_16| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_16|) (_ bv0 64)))))) is different from true [2024-11-05 08:18:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 137 proven. 2 refuted. 0 times theorem prover too weak. 41 trivial. 14 not checked. [2024-11-05 08:18:43,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:18:48,846 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:18:48,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2024-11-05 08:18:48,858 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2024-11-05 08:18:48,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 16 [2024-11-05 08:18:48,883 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 6 proven. 48 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2024-11-05 08:18:48,883 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:18:48,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1193756274] [2024-11-05 08:18:48,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1193756274] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:18:48,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:18:48,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2024-11-05 08:18:48,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001227563] [2024-11-05 08:18:48,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:18:48,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-05 08:18:48,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:18:48,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-05 08:18:48,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=573, Unknown=4, NotChecked=150, Total=812 [2024-11-05 08:18:48,886 INFO L87 Difference]: Start difference. First operand 155 states and 209 transitions. Second operand has 29 states, 27 states have (on average 4.62962962962963) internal successors, (125), 25 states have internal predecessors, (125), 11 states have call successors, (33), 5 states have call predecessors, (33), 11 states have return successors, (32), 13 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-05 08:18:53,867 WARN L873 $PredicateComparison]: unable to prove that (and (or (not (= (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_empty_#in~list.base|) |c_aws_linked_list_empty_#in~list.offset|) |c_aws_linked_list_empty_#in~list.base|)) (not (= (bvadd (_ bv16 64) |c_aws_linked_list_empty_#in~list.offset|) (select (select |c_#memory_$Pointer$#2.offset| |c_aws_linked_list_empty_#in~list.base|) |c_aws_linked_list_empty_#in~list.offset|))) (not (= |c_aws_linked_list_empty_#res| (_ bv0 8)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_14| (_ BitVec 64))) (not (= (_ bv16 64) (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_14|) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_14| (_ BitVec 64))) (not (= |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_14| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_pop_back_~list#1.base_BEFORE_CALL_14|) (_ bv0 64))))))) is different from true [2024-11-05 08:19:19,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:23,940 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:27,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:31,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:35,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-05 08:19:38,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:38,067 INFO L93 Difference]: Finished difference Result 355 states and 478 transitions. [2024-11-05 08:19:38,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-05 08:19:38,068 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 4.62962962962963) internal successors, (125), 25 states have internal predecessors, (125), 11 states have call successors, (33), 5 states have call predecessors, (33), 11 states have return successors, (32), 13 states have call predecessors, (32), 11 states have call successors, (32) Word has length 132 [2024-11-05 08:19:38,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:38,072 INFO L225 Difference]: With dead ends: 355 [2024-11-05 08:19:38,072 INFO L226 Difference]: Without dead ends: 206 [2024-11-05 08:19:38,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 232 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=143, Invalid=1054, Unknown=9, NotChecked=276, Total=1482 [2024-11-05 08:19:38,074 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 77 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 44 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 1891 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1086 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:38,075 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 1891 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1270 Invalid, 5 Unknown, 1086 Unchecked, 24.3s Time] [2024-11-05 08:19:38,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-05 08:19:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 193. [2024-11-05 08:19:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 135 states have (on average 1.2296296296296296) internal successors, (166), 137 states have internal predecessors, (166), 41 states have call successors, (41), 15 states have call predecessors, (41), 16 states have return successors, (48), 40 states have call predecessors, (48), 40 states have call successors, (48) [2024-11-05 08:19:38,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 255 transitions. [2024-11-05 08:19:38,131 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 255 transitions. Word has length 132 [2024-11-05 08:19:38,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:38,131 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 255 transitions. [2024-11-05 08:19:38,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 4.62962962962963) internal successors, (125), 25 states have internal predecessors, (125), 11 states have call successors, (33), 5 states have call predecessors, (33), 11 states have return successors, (32), 13 states have call predecessors, (32), 11 states have call successors, (32) [2024-11-05 08:19:38,132 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 255 transitions. [2024-11-05 08:19:38,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-05 08:19:38,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:38,134 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:38,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-05 08:19:38,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:38,338 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:38,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:38,338 INFO L85 PathProgramCache]: Analyzing trace with hash 994588701, now seen corresponding path program 2 times [2024-11-05 08:19:38,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:38,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [530219011] [2024-11-05 08:19:38,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:38,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:38,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:38,340 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:38,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-05 08:19:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:38,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-05 08:19:38,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:39,143 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 111 proven. 8 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-11-05 08:19:39,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:39,678 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2024-11-05 08:19:39,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2024-11-05 08:19:39,806 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-05 08:19:39,806 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:39,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [530219011] [2024-11-05 08:19:39,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [530219011] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-05 08:19:39,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-05 08:19:39,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2024-11-05 08:19:39,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752675136] [2024-11-05 08:19:39,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-05 08:19:39,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-05 08:19:39,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:39,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-05 08:19:39,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=232, Unknown=1, NotChecked=0, Total=272 [2024-11-05 08:19:39,808 INFO L87 Difference]: Start difference. First operand 193 states and 255 transitions. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 15 states have internal predecessors, (97), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-05 08:19:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:41,642 INFO L93 Difference]: Finished difference Result 372 states and 516 transitions. [2024-11-05 08:19:41,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-05 08:19:41,643 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 15 states have internal predecessors, (97), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) Word has length 142 [2024-11-05 08:19:41,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:41,645 INFO L225 Difference]: With dead ends: 372 [2024-11-05 08:19:41,645 INFO L226 Difference]: Without dead ends: 235 [2024-11-05 08:19:41,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=742, Unknown=3, NotChecked=0, Total=870 [2024-11-05 08:19:41,646 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 76 mSDsluCounter, 1605 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1772 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:41,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1772 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-05 08:19:41,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-05 08:19:41,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 200. [2024-11-05 08:19:41,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 141 states have (on average 1.2269503546099292) internal successors, (173), 142 states have internal predecessors, (173), 41 states have call successors, (41), 15 states have call predecessors, (41), 17 states have return successors, (54), 42 states have call predecessors, (54), 40 states have call successors, (54) [2024-11-05 08:19:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 268 transitions. [2024-11-05 08:19:41,668 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 268 transitions. Word has length 142 [2024-11-05 08:19:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:41,669 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 268 transitions. [2024-11-05 08:19:41,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 15 states have internal predecessors, (97), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (25), 5 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-05 08:19:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 268 transitions. [2024-11-05 08:19:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-05 08:19:41,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:41,670 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:41,682 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:19:41,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:41,871 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:41,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:41,872 INFO L85 PathProgramCache]: Analyzing trace with hash 262621275, now seen corresponding path program 1 times [2024-11-05 08:19:41,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:41,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1520926401] [2024-11-05 08:19:41,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:41,872 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:41,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:41,873 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-05 08:19:41,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-05 08:19:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:42,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-05 08:19:42,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:42,098 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-11-05 08:19:42,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-05 08:19:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2024-11-05 08:19:42,217 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-05 08:19:42,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1520926401] [2024-11-05 08:19:42,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1520926401] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-05 08:19:42,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-05 08:19:42,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2024-11-05 08:19:42,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538096205] [2024-11-05 08:19:42,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-05 08:19:42,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-05 08:19:42,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-05 08:19:42,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-05 08:19:42,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:19:42,218 INFO L87 Difference]: Start difference. First operand 200 states and 268 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 08:19:42,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-05 08:19:42,254 INFO L93 Difference]: Finished difference Result 350 states and 482 transitions. [2024-11-05 08:19:42,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-05 08:19:42,254 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) Word has length 142 [2024-11-05 08:19:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-05 08:19:42,256 INFO L225 Difference]: With dead ends: 350 [2024-11-05 08:19:42,256 INFO L226 Difference]: Without dead ends: 198 [2024-11-05 08:19:42,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-05 08:19:42,257 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 0 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-05 08:19:42,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 713 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-05 08:19:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-05 08:19:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2024-11-05 08:19:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 138 states have (on average 1.210144927536232) internal successors, (167), 140 states have internal predecessors, (167), 41 states have call successors, (41), 15 states have call predecessors, (41), 17 states have return successors, (52), 41 states have call predecessors, (52), 40 states have call successors, (52) [2024-11-05 08:19:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 260 transitions. [2024-11-05 08:19:42,278 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 260 transitions. Word has length 142 [2024-11-05 08:19:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-05 08:19:42,278 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 260 transitions. [2024-11-05 08:19:42,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-05 08:19:42,279 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 260 transitions. [2024-11-05 08:19:42,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-05 08:19:42,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-05 08:19:42,280 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-05 08:19:42,290 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 (13)] Ended with exit code 0 [2024-11-05 08:19:42,480 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:19:42,481 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-05 08:19:42,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-05 08:19:42,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1066239245, now seen corresponding path program 2 times [2024-11-05 08:19:42,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-05 08:19:42,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1310330073] [2024-11-05 08:19:42,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-05 08:19:42,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-05 08:19:42,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-05 08:19:42,483 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:19:42,484 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:19:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-05 08:19:42,697 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-05 08:19:42,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-05 08:19:46,834 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6|)))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6| (_ BitVec 64)) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_6|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_6|))))) is different from true