/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 --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.trace.refinement.strategy WOLF -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_next_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 05:22:53,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 05:22:53,143 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-06 05:22:53,149 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 05:22:53,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 05:22:53,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 05:22:53,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 05:22:53,172 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 05:22:53,172 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 05:22:53,173 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 05:22:53,173 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 05:22:53,173 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 05:22:53,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 05:22:53,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 05:22:53,174 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 05:22:53,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 05:22:53,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 05:22:53,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 05:22:53,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 05:22:53,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 05:22:53,177 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 05:22:53,180 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 05:22:53,180 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 05:22:53,180 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 05:22:53,180 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 05:22:53,181 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 05:22:53,181 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 05:22:53,181 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 05:22:53,181 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 05:22:53,182 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 05:22:53,182 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 05:22:53,182 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:22:53,182 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 05:22:53,182 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 05:22:53,183 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 05:22:53,183 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 05:22:53,183 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 05:22:53,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 05:22:53,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 05:22:53,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 05:22:53,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 05:22:53,187 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.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> WOLF [2024-11-06 05:22:53,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 05:22:53,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 05:22:53,442 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 05:22:53,443 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 05:22:53,443 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 05:22:53,444 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_next_harness.i [2024-11-06 05:22:54,776 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 05:22:55,260 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 05:22:55,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_next_harness.i [2024-11-06 05:22:55,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9dd045af/9a32c3ee8ada4aa4a289c237b6a29dbe/FLAGc59d1f95b [2024-11-06 05:22:55,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9dd045af/9a32c3ee8ada4aa4a289c237b6a29dbe [2024-11-06 05:22:55,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 05:22:55,418 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 05:22:55,423 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 05:22:55,423 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 05:22:55,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 05:22:55,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:22:55" (1/1) ... [2024-11-06 05:22:55,432 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c19726d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:55, skipping insertion in model container [2024-11-06 05:22:55,432 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 05:22:55" (1/1) ... [2024-11-06 05:22:55,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:22:55,830 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_next_harness.i[4494,4507] [2024-11-06 05:22:55,838 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_next_harness.i[4554,4567] [2024-11-06 05:22:56,592 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-06 05:22:56,659 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:56,659 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:56,659 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:56,665 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:56,666 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,667 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,671 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,672 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-06 05:22:56,672 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,673 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,674 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-06 05:22:56,675 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-06 05:22:56,676 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-06 05:22:56,677 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-06 05:22:56,682 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,683 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-06 05:22:56,683 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,683 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-06 05:22:56,684 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,684 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-06 05:22:56,685 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,685 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:56,686 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,686 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 05:22:56,686 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,687 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-06 05:22:56,687 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,687 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:56,936 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-06 05:22:56,937 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-06 05:22:56,937 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-06 05:22:56,937 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-06 05:22:57,095 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-06 05:22:57,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:22:57,142 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-06 05:22:57,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 05:22:57,182 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_next_harness.i[4494,4507] [2024-11-06 05:22:57,183 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_next_harness.i[4554,4567] [2024-11-06 05:22:57,232 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-06 05:22:57,247 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-06 05:22:57,247 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-06 05:22:57,248 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-06 05:22:57,254 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-06 05:22:57,255 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,255 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,255 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,256 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-06 05:22:57,256 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,264 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,265 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-06 05:22:57,265 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-06 05:22:57,269 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-06 05:22:57,270 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-06 05:22:57,273 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,273 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-06 05:22:57,273 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,273 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-06 05:22:57,274 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,274 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-06 05:22:57,274 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,275 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-06 05:22:57,275 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,276 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-06 05:22:57,276 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,276 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-06 05:22:57,276 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,276 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,323 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-06 05:22:57,323 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-06 05:22:57,324 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-06 05:22:57,324 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-06 05:22:57,353 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-06 05:22:57,360 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:22:57,367 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 05:22:57,383 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_next_harness.i[4494,4507] [2024-11-06 05:22:57,383 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_next_harness.i[4554,4567] [2024-11-06 05:22:57,422 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,422 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,423 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,423 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,423 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,428 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,428 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,430 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,430 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,431 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,431 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,432 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,432 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 05:22:57,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 05:22:57,615 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-06 05:22:57,623 INFO L204 MainTranslator]: Completed translation [2024-11-06 05:22:57,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57 WrapperNode [2024-11-06 05:22:57,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 05:22:57,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 05:22:57,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 05:22:57,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 05:22:57,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,723 INFO L138 Inliner]: procedures = 687, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 57 [2024-11-06 05:22:57,724 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 05:22:57,724 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 05:22:57,724 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 05:22:57,724 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 05:22:57,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,787 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 6, 5, 4]. 35 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0]. The 2 writes are split as follows [0, 1, 0, 1]. [2024-11-06 05:22:57,787 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,787 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,805 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,807 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,817 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 05:22:57,818 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 05:22:57,818 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 05:22:57,818 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 05:22:57,819 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (1/1) ... [2024-11-06 05:22:57,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 05:22:57,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 05:22:57,847 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-06 05:22:57,855 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-06 05:22:57,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 05:22:57,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 05:22:57,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 05:22:57,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 05:22:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-06 05:22:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 05:22:57,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 05:22:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-06 05:22:57,883 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-06 05:22:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 05:22:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 05:22:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 05:22:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 05:22:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-06 05:22:57,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 05:22:57,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 05:22:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 05:22:57,884 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 05:22:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 05:22:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 05:22:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 05:22:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 05:22:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-06 05:22:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 05:22:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 05:22:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 05:22:57,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-06 05:22:57,885 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2024-11-06 05:22:57,885 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2024-11-06 05:22:58,086 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 05:22:58,088 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 05:22:58,284 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-06 05:22:58,284 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 05:22:58,296 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 05:22:58,296 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-06 05:22:58,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:22:58 BoogieIcfgContainer [2024-11-06 05:22:58,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 05:22:58,299 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 05:22:58,299 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 05:22:58,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 05:22:58,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 05:22:55" (1/3) ... [2024-11-06 05:22:58,302 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473b12dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:22:58, skipping insertion in model container [2024-11-06 05:22:58,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 05:22:57" (2/3) ... [2024-11-06 05:22:58,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473b12dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 05:22:58, skipping insertion in model container [2024-11-06 05:22:58,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 05:22:58" (3/3) ... [2024-11-06 05:22:58,304 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2024-11-06 05:22:58,317 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 05:22:58,317 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 05:22:58,376 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 05:22:58,382 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;@79d0553d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 05:22:58,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 05:22:58,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-06 05:22:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 05:22:58,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:58,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:58,396 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:58,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:58,400 INFO L85 PathProgramCache]: Analyzing trace with hash 401849526, now seen corresponding path program 1 times [2024-11-06 05:22:58,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:58,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [763447198] [2024-11-06 05:22:58,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:58,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-06 05:22:58,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:58,418 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-06 05:22:58,419 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-06 05:22:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:58,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 05:22:58,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:58,621 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:22:58,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:58,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:58,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [763447198] [2024-11-06 05:22:58,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [763447198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:58,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:58,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 05:22:58,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034230370] [2024-11-06 05:22:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:58,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 05:22:58,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:58,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 05:22:58,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 05:22:58,646 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 05:22:58,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:22:58,665 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2024-11-06 05:22:58,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 05:22:58,666 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-11-06 05:22:58,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:22:58,672 INFO L225 Difference]: With dead ends: 94 [2024-11-06 05:22:58,673 INFO L226 Difference]: Without dead ends: 45 [2024-11-06 05:22:58,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 27 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-06 05:22:58,678 INFO L432 NwaCegarLoop]: 61 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, 61 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-06 05:22:58,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:22:58,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-06 05:22:58,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-06 05:22:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-06 05:22:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2024-11-06 05:22:58,713 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2024-11-06 05:22:58,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:22:58,714 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2024-11-06 05:22:58,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-06 05:22:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2024-11-06 05:22:58,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 05:22:58,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:22:58,717 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:22:58,727 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-06 05:22:58,921 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-06 05:22:58,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:22:58,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:22:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash -619218828, now seen corresponding path program 1 times [2024-11-06 05:22:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:22:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883392849] [2024-11-06 05:22:58,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:22:58,925 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-06 05:22:58,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:22:58,930 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-06 05:22:58,932 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-06 05:22:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:22:59,053 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-06 05:22:59,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:22:59,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 05:22:59,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:22:59,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-06 05:22:59,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:22:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 05:22:59,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:22:59,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:22:59,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883392849] [2024-11-06 05:22:59,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883392849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:22:59,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:22:59,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-06 05:22:59,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897284497] [2024-11-06 05:22:59,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:22:59,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 05:22:59,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:22:59,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 05:22:59,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-06 05:22:59,909 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 05:23:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:01,014 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2024-11-06 05:23:01,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 05:23:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-06 05:23:01,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:01,019 INFO L225 Difference]: With dead ends: 56 [2024-11-06 05:23:01,019 INFO L226 Difference]: Without dead ends: 54 [2024-11-06 05:23:01,019 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-06 05:23:01,020 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 45 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:01,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 243 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 05:23:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-06 05:23:01,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2024-11-06 05:23:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 35 states have internal predecessors, (38), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-11-06 05:23:01,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 66 transitions. [2024-11-06 05:23:01,036 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 66 transitions. Word has length 28 [2024-11-06 05:23:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:01,036 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 66 transitions. [2024-11-06 05:23:01,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 05:23:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2024-11-06 05:23:01,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 05:23:01,038 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:01,038 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:01,045 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 (3)] Forceful destruction successful, exit code 0 [2024-11-06 05:23:01,242 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-06 05:23:01,243 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:01,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:01,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1428565454, now seen corresponding path program 1 times [2024-11-06 05:23:01,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:01,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983586777] [2024-11-06 05:23:01,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:01,245 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-06 05:23:01,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:01,247 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-06 05:23:01,248 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-06 05:23:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:01,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 05:23:01,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:01,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-06 05:23:01,617 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 05:23:01,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:23:01,617 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:01,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983586777] [2024-11-06 05:23:01,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983586777] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:23:01,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:23:01,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 05:23:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446374837] [2024-11-06 05:23:01,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:01,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:23:01,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:01,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:23:01,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:23:01,619 INFO L87 Difference]: Start difference. First operand 53 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 05:23:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:02,386 INFO L93 Difference]: Finished difference Result 108 states and 135 transitions. [2024-11-06 05:23:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 05:23:02,387 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-06 05:23:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:02,388 INFO L225 Difference]: With dead ends: 108 [2024-11-06 05:23:02,388 INFO L226 Difference]: Without dead ends: 58 [2024-11-06 05:23:02,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-06 05:23:02,389 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 47 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:02,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 140 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 05:23:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-06 05:23:02,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-06 05:23:02,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 37 states have (on average 1.162162162162162) internal successors, (43), 40 states have internal predecessors, (43), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-06 05:23:02,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2024-11-06 05:23:02,400 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 28 [2024-11-06 05:23:02,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:02,400 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2024-11-06 05:23:02,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 05:23:02,400 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2024-11-06 05:23:02,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-06 05:23:02,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:02,401 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:02,407 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-06 05:23:02,607 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-06 05:23:02,608 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:02,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:02,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1821592464, now seen corresponding path program 1 times [2024-11-06 05:23:02,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:02,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1839440094] [2024-11-06 05:23:02,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:02,609 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-06 05:23:02,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:02,615 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-06 05:23:02,616 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-06 05:23:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:02,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 05:23:02,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-06 05:23:02,902 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:23:02,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1839440094] [2024-11-06 05:23:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1839440094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:23:02,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:23:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 05:23:02,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158446286] [2024-11-06 05:23:02,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:02,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 05:23:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:02,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 05:23:02,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:23:02,904 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 05:23:02,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:02,986 INFO L93 Difference]: Finished difference Result 115 states and 142 transitions. [2024-11-06 05:23:02,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 05:23:02,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2024-11-06 05:23:02,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:02,991 INFO L225 Difference]: With dead ends: 115 [2024-11-06 05:23:02,991 INFO L226 Difference]: Without dead ends: 60 [2024-11-06 05:23:02,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:23:02,995 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 3 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:02,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 151 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:23:02,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-06 05:23:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2024-11-06 05:23:03,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 37 states have internal predecessors, (41), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-06 05:23:03,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2024-11-06 05:23:03,009 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 28 [2024-11-06 05:23:03,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:03,009 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2024-11-06 05:23:03,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-06 05:23:03,009 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2024-11-06 05:23:03,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 05:23:03,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:03,010 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 05:23:03,016 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 (5)] Forceful destruction successful, exit code 0 [2024-11-06 05:23:03,210 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-06 05:23:03,210 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:03,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:03,211 INFO L85 PathProgramCache]: Analyzing trace with hash -239457674, now seen corresponding path program 1 times [2024-11-06 05:23:03,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:03,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528411216] [2024-11-06 05:23:03,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:03,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:23:03,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:03,214 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-06 05:23:03,215 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-06 05:23:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:03,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-06 05:23:03,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:03,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-06 05:23:03,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 05:23:03,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:23:03,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:23:04,465 INFO L349 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2024-11-06 05:23:04,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 106 [2024-11-06 05:23:04,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-06 05:23:04,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:23:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-06 05:23:05,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1528411216] [2024-11-06 05:23:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1528411216] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 05:23:05,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 05:23:05,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2024-11-06 05:23:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110265403] [2024-11-06 05:23:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:05,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 05:23:05,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:05,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 05:23:05,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2024-11-06 05:23:05,206 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 05:23:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:05,774 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2024-11-06 05:23:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 05:23:05,775 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-06 05:23:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:05,776 INFO L225 Difference]: With dead ends: 65 [2024-11-06 05:23:05,776 INFO L226 Difference]: Without dead ends: 63 [2024-11-06 05:23:05,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=65, Invalid=441, Unknown=0, NotChecked=0, Total=506 [2024-11-06 05:23:05,777 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:05,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 343 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 05:23:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-06 05:23:05,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2024-11-06 05:23:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.15) internal successors, (46), 43 states have internal predecessors, (46), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-11-06 05:23:05,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2024-11-06 05:23:05,790 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 42 [2024-11-06 05:23:05,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:05,790 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2024-11-06 05:23:05,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 05:23:05,791 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2024-11-06 05:23:05,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 05:23:05,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:05,791 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 05:23:05,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-06 05:23:05,995 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-06 05:23:05,996 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:05,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1048804300, now seen corresponding path program 1 times [2024-11-06 05:23:05,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474712360] [2024-11-06 05:23:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:05,997 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-06 05:23:05,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:06,001 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-06 05:23:06,002 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-06 05:23:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:06,112 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-06 05:23:06,117 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:06,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 05:23:06,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-06 05:23:06,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:23:06,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:23:06,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-06 05:23:06,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:23:06,831 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:23:07,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-06 05:23:07,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:07,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474712360] [2024-11-06 05:23:07,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474712360] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 05:23:07,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 05:23:07,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 17 [2024-11-06 05:23:07,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110680554] [2024-11-06 05:23:07,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:07,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:23:07,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:07,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:23:07,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2024-11-06 05:23:07,191 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 05:23:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:07,576 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2024-11-06 05:23:07,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 05:23:07,576 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-06 05:23:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:07,577 INFO L225 Difference]: With dead ends: 107 [2024-11-06 05:23:07,577 INFO L226 Difference]: Without dead ends: 67 [2024-11-06 05:23:07,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-06 05:23:07,578 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 10 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:07,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 208 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 05:23:07,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-06 05:23:07,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-06 05:23:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.1590909090909092) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2024-11-06 05:23:07,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2024-11-06 05:23:07,589 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 42 [2024-11-06 05:23:07,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:07,589 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2024-11-06 05:23:07,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 05:23:07,589 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2024-11-06 05:23:07,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 05:23:07,590 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:07,590 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 05:23:07,596 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-06 05:23:07,790 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-06 05:23:07,791 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:07,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:07,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1441831310, now seen corresponding path program 1 times [2024-11-06 05:23:07,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:07,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [111939971] [2024-11-06 05:23:07,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:07,792 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-06 05:23:07,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:07,793 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-06 05:23:07,794 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-06 05:23:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:07,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-06 05:23:07,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:07,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-06 05:23:08,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-06 05:23:08,059 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 05:23:08,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:23:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-06 05:23:08,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:08,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [111939971] [2024-11-06 05:23:08,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [111939971] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 05:23:08,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 05:23:08,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2024-11-06 05:23:08,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145672781] [2024-11-06 05:23:08,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:08,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:23:08,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:08,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:23:08,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 05:23:08,132 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 05:23:08,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:08,238 INFO L93 Difference]: Finished difference Result 119 states and 141 transitions. [2024-11-06 05:23:08,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 05:23:08,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2024-11-06 05:23:08,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:08,240 INFO L225 Difference]: With dead ends: 119 [2024-11-06 05:23:08,240 INFO L226 Difference]: Without dead ends: 69 [2024-11-06 05:23:08,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:23:08,240 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:08,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 235 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:23:08,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-06 05:23:08,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2024-11-06 05:23:08,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 45 states have internal predecessors, (49), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-06 05:23:08,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2024-11-06 05:23:08,248 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 42 [2024-11-06 05:23:08,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:08,249 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2024-11-06 05:23:08,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 05:23:08,249 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2024-11-06 05:23:08,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-06 05:23:08,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:08,250 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-06 05:23:08,256 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-06 05:23:08,453 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-06 05:23:08,453 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:08,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:08,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1432152549, now seen corresponding path program 1 times [2024-11-06 05:23:08,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:08,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645486763] [2024-11-06 05:23:08,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:08,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:23:08,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:08,457 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-06 05:23:08,458 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-06 05:23:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:08,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 05:23:08,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:08,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 05:23:08,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 05:23:08,923 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-06 05:23:08,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:23:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-06 05:23:09,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:09,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645486763] [2024-11-06 05:23:09,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645486763] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 05:23:09,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 05:23:09,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 12 [2024-11-06 05:23:09,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519766041] [2024-11-06 05:23:09,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:09,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 05:23:09,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:09,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 05:23:09,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-06 05:23:09,019 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-06 05:23:09,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:09,139 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-06 05:23:09,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 05:23:09,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2024-11-06 05:23:09,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:09,141 INFO L225 Difference]: With dead ends: 69 [2024-11-06 05:23:09,141 INFO L226 Difference]: Without dead ends: 67 [2024-11-06 05:23:09,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 11 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-06 05:23:09,141 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 3 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:09,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 237 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:23:09,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-06 05:23:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-06 05:23:09,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2024-11-06 05:23:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 77 transitions. [2024-11-06 05:23:09,158 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 77 transitions. Word has length 48 [2024-11-06 05:23:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:09,158 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 77 transitions. [2024-11-06 05:23:09,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-11-06 05:23:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 77 transitions. [2024-11-06 05:23:09,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-06 05:23:09,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:09,162 INFO L215 NwaCegarLoop]: trace histogram [4, 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] [2024-11-06 05:23:09,177 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-06 05:23:09,363 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-06 05:23:09,363 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:09,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:09,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1836428547, now seen corresponding path program 1 times [2024-11-06 05:23:09,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:09,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702197507] [2024-11-06 05:23:09,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:09,364 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-06 05:23:09,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:09,366 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-06 05:23:09,368 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-06 05:23:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:09,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-06 05:23:09,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:09,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-06 05:23:09,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:23:09,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 05:23:09,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:23:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-06 05:23:10,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:23:11,416 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-06 05:23:11,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:11,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702197507] [2024-11-06 05:23:11,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702197507] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 05:23:11,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 05:23:11,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 18 [2024-11-06 05:23:11,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19104293] [2024-11-06 05:23:11,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:11,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 05:23:11,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:11,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 05:23:11,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2024-11-06 05:23:11,424 INFO L87 Difference]: Start difference. First operand 67 states and 77 transitions. Second operand has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 05:23:11,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:11,928 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2024-11-06 05:23:11,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 05:23:11,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2024-11-06 05:23:11,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:11,930 INFO L225 Difference]: With dead ends: 78 [2024-11-06 05:23:11,930 INFO L226 Difference]: Without dead ends: 76 [2024-11-06 05:23:11,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 101 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-11-06 05:23:11,930 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 10 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:11,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 282 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 05:23:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-06 05:23:11,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2024-11-06 05:23:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.14) internal successors, (57), 54 states have internal predecessors, (57), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-11-06 05:23:11,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2024-11-06 05:23:11,967 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 63 [2024-11-06 05:23:11,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:11,967 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2024-11-06 05:23:11,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 05:23:11,967 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2024-11-06 05:23:11,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-06 05:23:11,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:11,968 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:11,981 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-06 05:23:12,168 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-06 05:23:12,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:12,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:12,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1027081921, now seen corresponding path program 1 times [2024-11-06 05:23:12,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:12,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619619054] [2024-11-06 05:23:12,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:12,170 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-06 05:23:12,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:12,172 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-06 05:23:12,173 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-06 05:23:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:12,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-06 05:23:12,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:12,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-06 05:23:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-06 05:23:12,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:23:12,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:12,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619619054] [2024-11-06 05:23:12,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619619054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:23:12,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:23:12,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 05:23:12,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722531048] [2024-11-06 05:23:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:12,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:23:12,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:23:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-06 05:23:12,680 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 05:23:13,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:13,382 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2024-11-06 05:23:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 05:23:13,383 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2024-11-06 05:23:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:13,384 INFO L225 Difference]: With dead ends: 102 [2024-11-06 05:23:13,384 INFO L226 Difference]: Without dead ends: 75 [2024-11-06 05:23:13,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 14 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-06 05:23:13,385 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:13,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 132 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 05:23:13,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-06 05:23:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2024-11-06 05:23:13,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 50 states have (on average 1.12) internal successors, (56), 54 states have internal predecessors, (56), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2024-11-06 05:23:13,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 84 transitions. [2024-11-06 05:23:13,401 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 84 transitions. Word has length 63 [2024-11-06 05:23:13,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:13,402 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 84 transitions. [2024-11-06 05:23:13,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 05:23:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 84 transitions. [2024-11-06 05:23:13,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-06 05:23:13,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:13,403 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:13,410 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-06 05:23:13,606 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-06 05:23:13,607 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:13,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:13,607 INFO L85 PathProgramCache]: Analyzing trace with hash 634054911, now seen corresponding path program 1 times [2024-11-06 05:23:13,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:13,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [34471155] [2024-11-06 05:23:13,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:13,608 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-06 05:23:13,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:13,610 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-06 05:23:13,611 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-06 05:23:13,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:13,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 05:23:13,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:13,804 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-06 05:23:13,804 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 05:23:13,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:13,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [34471155] [2024-11-06 05:23:13,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [34471155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 05:23:13,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 05:23:13,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-06 05:23:13,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411285226] [2024-11-06 05:23:13,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:13,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 05:23:13,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:13,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 05:23:13,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:23:13,806 INFO L87 Difference]: Start difference. First operand 75 states and 84 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 05:23:13,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:13,827 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2024-11-06 05:23:13,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 05:23:13,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2024-11-06 05:23:13,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:13,828 INFO L225 Difference]: With dead ends: 103 [2024-11-06 05:23:13,828 INFO L226 Difference]: Without dead ends: 66 [2024-11-06 05:23:13,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 05:23:13,829 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:13,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 144 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 05:23:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-06 05:23:13,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-06 05:23:13,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 46 states have internal predecessors, (48), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2024-11-06 05:23:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2024-11-06 05:23:13,837 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 63 [2024-11-06 05:23:13,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:13,838 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2024-11-06 05:23:13,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-11-06 05:23:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2024-11-06 05:23:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-06 05:23:13,838 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:13,839 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:13,848 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-06 05:23:14,039 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-06 05:23:14,039 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:14,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:14,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1007142523, now seen corresponding path program 1 times [2024-11-06 05:23:14,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:14,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381084163] [2024-11-06 05:23:14,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:14,040 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-06 05:23:14,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:14,043 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-06 05:23:14,044 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-06 05:23:14,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:14,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-06 05:23:14,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:14,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-06 05:23:14,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:23:14,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 05:23:14,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:23:16,181 INFO L349 Elim1Store]: treesize reduction 21, result has 43.2 percent of original size [2024-11-06 05:23:16,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 106 [2024-11-06 05:23:16,255 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-06 05:23:16,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:23:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 05:23:17,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:17,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381084163] [2024-11-06 05:23:17,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381084163] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 05:23:17,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 05:23:17,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 24 [2024-11-06 05:23:17,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280776933] [2024-11-06 05:23:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:17,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-06 05:23:17,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:17,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-06 05:23:17,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2024-11-06 05:23:17,055 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 05:23:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:17,890 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2024-11-06 05:23:17,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-06 05:23:17,890 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2024-11-06 05:23:17,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:17,891 INFO L225 Difference]: With dead ends: 77 [2024-11-06 05:23:17,891 INFO L226 Difference]: Without dead ends: 75 [2024-11-06 05:23:17,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 112 SyntacticMatches, 18 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2024-11-06 05:23:17,892 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:17,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 327 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 05:23:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-06 05:23:17,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2024-11-06 05:23:17,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 52 states have internal predecessors, (53), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-06 05:23:17,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2024-11-06 05:23:17,907 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 77 [2024-11-06 05:23:17,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:17,907 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2024-11-06 05:23:17,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 05:23:17,907 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2024-11-06 05:23:17,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-06 05:23:17,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:17,908 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2024-11-06 05:23:17,916 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-06 05:23:18,111 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-06 05:23:18,111 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:18,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:18,111 INFO L85 PathProgramCache]: Analyzing trace with hash 197795897, now seen corresponding path program 1 times [2024-11-06 05:23:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:18,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224738739] [2024-11-06 05:23:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:18,112 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-06 05:23:18,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:18,118 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-06 05:23:18,119 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-06 05:23:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:18,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-06 05:23:18,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:18,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 05:23:18,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:23:18,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-06 05:23:18,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-06 05:23:18,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2024-11-06 05:23:19,435 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-06 05:23:19,436 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:23:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 05:23:19,803 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:19,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224738739] [2024-11-06 05:23:19,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224738739] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 05:23:19,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 05:23:19,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 21 [2024-11-06 05:23:19,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838368155] [2024-11-06 05:23:19,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:19,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 05:23:19,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:19,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 05:23:19,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2024-11-06 05:23:19,805 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 05:23:20,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:20,315 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2024-11-06 05:23:20,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 05:23:20,316 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2024-11-06 05:23:20,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:20,316 INFO L225 Difference]: With dead ends: 86 [2024-11-06 05:23:20,316 INFO L226 Difference]: Without dead ends: 74 [2024-11-06 05:23:20,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 116 SyntacticMatches, 17 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2024-11-06 05:23:20,317 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 10 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:20,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 217 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 05:23:20,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-06 05:23:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-06 05:23:20,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.0612244897959184) internal successors, (52), 52 states have internal predecessors, (52), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-06 05:23:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2024-11-06 05:23:20,327 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 77 [2024-11-06 05:23:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:20,327 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2024-11-06 05:23:20,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 05:23:20,327 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2024-11-06 05:23:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-06 05:23:20,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:20,328 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2024-11-06 05:23:20,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-06 05:23:20,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:23:20,533 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:20,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:20,533 INFO L85 PathProgramCache]: Analyzing trace with hash -195231113, now seen corresponding path program 1 times [2024-11-06 05:23:20,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:20,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1699228157] [2024-11-06 05:23:20,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:20,534 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-06 05:23:20,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:20,536 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:23:20,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-06 05:23:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:20,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-06 05:23:20,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:20,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-06 05:23:20,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-06 05:23:20,836 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-06 05:23:20,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:23:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 05:23:20,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:20,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1699228157] [2024-11-06 05:23:20,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1699228157] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 05:23:20,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 05:23:20,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 9 [2024-11-06 05:23:20,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875431743] [2024-11-06 05:23:20,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:20,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:23:20,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:20,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:23:20,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-06 05:23:20,916 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 05:23:21,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:21,020 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2024-11-06 05:23:21,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 05:23:21,021 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2024-11-06 05:23:21,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:21,021 INFO L225 Difference]: With dead ends: 87 [2024-11-06 05:23:21,021 INFO L226 Difference]: Without dead ends: 63 [2024-11-06 05:23:21,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-06 05:23:21,022 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:21,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 269 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:23:21,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-06 05:23:21,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-06 05:23:21,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 42 states have (on average 1.0) internal successors, (42), 42 states have internal predecessors, (42), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-06 05:23:21,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2024-11-06 05:23:21,031 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 77 [2024-11-06 05:23:21,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:21,031 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2024-11-06 05:23:21,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-06 05:23:21,031 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2024-11-06 05:23:21,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-06 05:23:21,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 05:23:21,032 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:21,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-06 05:23:21,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:23:21,232 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 05:23:21,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 05:23:21,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1385380010, now seen corresponding path program 1 times [2024-11-06 05:23:21,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-06 05:23:21,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1154740963] [2024-11-06 05:23:21,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 05:23:21,234 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-06 05:23:21,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-06 05:23:21,237 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-06 05:23:21,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-06 05:23:21,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 05:23:21,474 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-06 05:23:21,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 05:23:21,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 05:23:21,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-06 05:23:21,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-06 05:23:21,739 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-06 05:23:21,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 05:23:21,955 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 05:23:21,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-06 05:23:21,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1154740963] [2024-11-06 05:23:21,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1154740963] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 05:23:21,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 05:23:21,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2024-11-06 05:23:21,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499190027] [2024-11-06 05:23:21,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 05:23:21,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 05:23:21,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-06 05:23:21,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 05:23:21,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-06 05:23:21,957 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-06 05:23:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 05:23:22,122 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2024-11-06 05:23:22,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 05:23:22,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 83 [2024-11-06 05:23:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 05:23:22,122 INFO L225 Difference]: With dead ends: 63 [2024-11-06 05:23:22,122 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 05:23:22,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 148 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-06 05:23:22,123 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 05:23:22,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 252 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 05:23:22,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 05:23:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 05:23:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 05:23:22,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 05:23:22,124 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2024-11-06 05:23:22,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 05:23:22,124 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 05:23:22,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 7 states have internal predecessors, (30), 3 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2024-11-06 05:23:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 05:23:22,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 05:23:22,126 INFO L782 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 05:23:22,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-11-06 05:23:22,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-06 05:23:22,329 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 05:23:22,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.