/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 FOX -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness.i -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-17387ad-m [2024-11-06 14:23:08,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 14:23:08,940 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 14:23:08,943 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 14:23:08,943 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 14:23:08,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 14:23:08,964 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 14:23:08,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 14:23:08,965 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 14:23:08,966 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 14:23:08,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 14:23:08,967 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 14:23:08,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 14:23:08,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 14:23:08,968 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 14:23:08,968 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 14:23:08,969 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 14:23:08,969 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 14:23:08,969 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 14:23:08,969 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 14:23:08,969 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 14:23:08,973 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-06 14:23:08,973 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-06 14:23:08,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 14:23:08,973 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-06 14:23:08,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 14:23:08,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 14:23:08,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 14:23:08,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 14:23:08,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 14:23:08,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 14:23:08,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 14:23:08,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 14:23:08,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 14:23:08,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 14:23:08,975 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-06 14:23:08,975 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-06 14:23:08,975 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 14:23:08,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 14:23:08,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 14:23:08,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 14:23:08,976 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 -> FOX [2024-11-06 14:23:09,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 14:23:09,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 14:23:09,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 14:23:09,164 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 14:23:09,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 14:23:09,166 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_rend_harness.i [2024-11-06 14:23:10,372 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 14:23:10,687 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 14:23:10,687 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness.i [2024-11-06 14:23:10,716 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbedb9225/62dd5426d61f4e80b29396b7503ab527/FLAG32c310232 [2024-11-06 14:23:10,941 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbedb9225/62dd5426d61f4e80b29396b7503ab527 [2024-11-06 14:23:10,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 14:23:10,945 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-06 14:23:10,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 14:23:10,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 14:23:10,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 14:23:10,951 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:23:10" (1/1) ... [2024-11-06 14:23:10,952 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20211ed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:10, skipping insertion in model container [2024-11-06 14:23:10,952 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 02:23:10" (1/1) ... [2024-11-06 14:23:11,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 14:23:11,201 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_rend_harness.i[4494,4507] [2024-11-06 14:23:11,208 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_rend_harness.i[4554,4567] [2024-11-06 14:23:11,653 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 14:23:11,721 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 14:23:11,721 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 14:23:11,722 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 14:23:11,730 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 14:23:11,735 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,735 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,737 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,737 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 14:23:11,737 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,738 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,740 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 14:23:11,743 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 14:23:11,746 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 14:23:11,746 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-06 14:23:11,755 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,755 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 14:23:11,756 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,756 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 14:23:11,757 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,757 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 14:23:11,758 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,758 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 14:23:11,760 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,760 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 14:23:11,761 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,761 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 14:23:11,761 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,761 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:11,980 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 14:23:11,981 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 14:23:11,981 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 14:23:11,982 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 14:23:12,086 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 14:23:12,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 14:23:12,114 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-06 14:23:12,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 14:23:12,142 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_rend_harness.i[4494,4507] [2024-11-06 14:23:12,143 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_rend_harness.i[4554,4567] [2024-11-06 14:23:12,163 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 14:23:12,175 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 14:23:12,175 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 14:23:12,175 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 14:23:12,179 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 14:23:12,180 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,180 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,180 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,180 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 14:23:12,181 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,181 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,182 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 14:23:12,182 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 14:23:12,183 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 14:23:12,183 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 14:23:12,186 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,186 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 14:23:12,187 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,187 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 14:23:12,187 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,188 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 14:23:12,188 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,188 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 14:23:12,189 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,189 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 14:23:12,189 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,190 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 14:23:12,190 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,191 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,221 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 14:23:12,221 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 14:23:12,221 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 14:23:12,222 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 14:23:12,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 14:23:12,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 14:23:12,257 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 14:23:12,267 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_rend_harness.i[4494,4507] [2024-11-06 14:23:12,268 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_rend_harness.i[4554,4567] [2024-11-06 14:23:12,336 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,336 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,336 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,337 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,337 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,344 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,345 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,347 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,347 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,348 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,348 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,348 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,349 WARN L1674 CHandler]: Possible shadowing of function index [2024-11-06 14:23:12,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 14:23:12,511 WARN L710 CHandler]: The following functions are not defined or handled internally: aws_array_list_ensure_capacity [2024-11-06 14:23:12,519 INFO L204 MainTranslator]: Completed translation [2024-11-06 14:23:12,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12 WrapperNode [2024-11-06 14:23:12,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 14:23:12,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 14:23:12,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 14:23:12,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 14:23:12,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,603 INFO L138 Inliner]: procedures = 687, calls = 1038, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 138 [2024-11-06 14:23:12,603 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 14:23:12,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 14:23:12,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 14:23:12,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 14:23:12,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,641 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 5, 14]. 67 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-06 14:23:12,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,654 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,667 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,669 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 14:23:12,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 14:23:12,678 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 14:23:12,678 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 14:23:12,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (1/1) ... [2024-11-06 14:23:12,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 14:23:12,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:12,704 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 14:23:12,706 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 14:23:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-06 14:23:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-06 14:23:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-06 14:23:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-06 14:23:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-06 14:23:12,724 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-06 14:23:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-06 14:23:12,724 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-06 14:23:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-06 14:23:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-06 14:23:12,724 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-06 14:23:12,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 14:23:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-06 14:23:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-06 14:23:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-06 14:23:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 14:23:12,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 14:23:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-06 14:23:12,725 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-06 14:23:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-06 14:23:12,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-06 14:23:12,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-06 14:23:12,726 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-06 14:23:12,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-06 14:23:12,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-06 14:23:12,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-06 14:23:12,727 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-06 14:23:12,727 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-06 14:23:12,905 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 14:23:12,907 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 14:23:13,156 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-06 14:23:13,157 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 14:23:13,173 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 14:23:13,173 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-06 14:23:13,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:23:13 BoogieIcfgContainer [2024-11-06 14:23:13,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 14:23:13,175 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 14:23:13,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 14:23:13,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 14:23:13,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 02:23:10" (1/3) ... [2024-11-06 14:23:13,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c821c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:23:13, skipping insertion in model container [2024-11-06 14:23:13,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 02:23:12" (2/3) ... [2024-11-06 14:23:13,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c821c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 02:23:13, skipping insertion in model container [2024-11-06 14:23:13,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 02:23:13" (3/3) ... [2024-11-06 14:23:13,181 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness.i [2024-11-06 14:23:13,192 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 14:23:13,193 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 14:23:13,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 14:23:13,236 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;@556552bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 14:23:13,236 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 14:23:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-06 14:23:13,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-06 14:23:13,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:13,247 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:13,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:13,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:13,251 INFO L85 PathProgramCache]: Analyzing trace with hash -2107862704, now seen corresponding path program 1 times [2024-11-06 14:23:13,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:13,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [90743503] [2024-11-06 14:23:13,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:13,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:13,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:13,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:13,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 14:23:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:13,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-06 14:23:13,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:13,480 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-06 14:23:13,480 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:13,481 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:13,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90743503] [2024-11-06 14:23:13,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90743503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:13,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:13,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 14:23:13,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940881270] [2024-11-06 14:23:13,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:13,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-06 14:23:13,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:13,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-06 14:23:13,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-06 14:23:13,500 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 14:23:13,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:13,517 INFO L93 Difference]: Finished difference Result 128 states and 184 transitions. [2024-11-06 14:23:13,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-06 14:23:13,519 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-06 14:23:13,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:13,523 INFO L225 Difference]: With dead ends: 128 [2024-11-06 14:23:13,523 INFO L226 Difference]: Without dead ends: 63 [2024-11-06 14:23:13,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 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 14:23:13,530 INFO L432 NwaCegarLoop]: 87 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, 87 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 14:23:13,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 14:23:13,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-06 14:23:13,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-06 14:23:13,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 45 states have internal predecessors, (57), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-06 14:23:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2024-11-06 14:23:13,557 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 68 [2024-11-06 14:23:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:13,557 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2024-11-06 14:23:13,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 14:23:13,558 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2024-11-06 14:23:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-06 14:23:13,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:13,560 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:13,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 14:23:13,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:13,760 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:13,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:13,761 INFO L85 PathProgramCache]: Analyzing trace with hash 900796622, now seen corresponding path program 1 times [2024-11-06 14:23:13,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:13,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [792735031] [2024-11-06 14:23:13,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:13,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:13,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:13,765 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:13,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 14:23:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:13,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 14:23:13,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:13,980 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 14:23:13,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:13,981 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:13,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792735031] [2024-11-06 14:23:13,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792735031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:13,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:13,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 14:23:13,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195045599] [2024-11-06 14:23:13,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:13,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 14:23:13,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:13,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 14:23:13,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 14:23:13,983 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 14:23:14,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:14,028 INFO L93 Difference]: Finished difference Result 114 states and 152 transitions. [2024-11-06 14:23:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 14:23:14,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-06 14:23:14,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:14,030 INFO L225 Difference]: With dead ends: 114 [2024-11-06 14:23:14,030 INFO L226 Difference]: Without dead ends: 65 [2024-11-06 14:23:14,031 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 14:23:14,031 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:14,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 377 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 14:23:14,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-06 14:23:14,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-06 14:23:14,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.288888888888889) internal successors, (58), 47 states have internal predecessors, (58), 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 14:23:14,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 86 transitions. [2024-11-06 14:23:14,039 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 86 transitions. Word has length 68 [2024-11-06 14:23:14,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:14,039 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 86 transitions. [2024-11-06 14:23:14,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 3 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-06 14:23:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 86 transitions. [2024-11-06 14:23:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-06 14:23:14,040 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:14,041 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-06 14:23:14,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 14:23:14,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:14,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:14,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:14,242 INFO L85 PathProgramCache]: Analyzing trace with hash 577933322, now seen corresponding path program 1 times [2024-11-06 14:23:14,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:14,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1446551709] [2024-11-06 14:23:14,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:14,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:14,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:14,244 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:14,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 14:23:14,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:14,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 14:23:14,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:14,457 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 14:23:14,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:14,458 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:14,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446551709] [2024-11-06 14:23:14,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446551709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:14,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:14,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 14:23:14,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229943023] [2024-11-06 14:23:14,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:14,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 14:23:14,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:14,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 14:23:14,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 14:23:14,460 INFO L87 Difference]: Start difference. First operand 65 states and 86 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 14:23:14,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:14,565 INFO L93 Difference]: Finished difference Result 121 states and 163 transitions. [2024-11-06 14:23:14,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 14:23:14,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-06 14:23:14,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:14,567 INFO L225 Difference]: With dead ends: 121 [2024-11-06 14:23:14,567 INFO L226 Difference]: Without dead ends: 70 [2024-11-06 14:23:14,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 14:23:14,568 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:14,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 300 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 14:23:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-06 14:23:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-06 14:23:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 50 states have internal predecessors, (60), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-06 14:23:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 90 transitions. [2024-11-06 14:23:14,582 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 90 transitions. Word has length 70 [2024-11-06 14:23:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:14,583 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 90 transitions. [2024-11-06 14:23:14,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 14:23:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 90 transitions. [2024-11-06 14:23:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-06 14:23:14,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:14,584 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-06 14:23:14,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 14:23:14,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:14,785 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:14,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:14,786 INFO L85 PathProgramCache]: Analyzing trace with hash -34807881, now seen corresponding path program 1 times [2024-11-06 14:23:14,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:14,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544883656] [2024-11-06 14:23:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:14,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:14,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:14,788 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:14,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-06 14:23:14,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:14,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 14:23:14,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:14,992 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 14:23:14,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:14,992 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:14,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544883656] [2024-11-06 14:23:14,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544883656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:14,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:14,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 14:23:14,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781799833] [2024-11-06 14:23:14,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:14,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 14:23:14,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:14,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 14:23:14,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 14:23:14,994 INFO L87 Difference]: Start difference. First operand 68 states and 90 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 14:23:15,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:15,146 INFO L93 Difference]: Finished difference Result 133 states and 181 transitions. [2024-11-06 14:23:15,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-06 14:23:15,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-06 14:23:15,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:15,147 INFO L225 Difference]: With dead ends: 133 [2024-11-06 14:23:15,147 INFO L226 Difference]: Without dead ends: 79 [2024-11-06 14:23:15,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 14:23:15,149 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 29 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:15,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 354 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 14:23:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-06 14:23:15,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2024-11-06 14:23:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.2857142857142858) internal successors, (63), 52 states have internal predecessors, (63), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-06 14:23:15,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 93 transitions. [2024-11-06 14:23:15,164 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 93 transitions. Word has length 72 [2024-11-06 14:23:15,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:15,164 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 93 transitions. [2024-11-06 14:23:15,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 14:23:15,164 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 93 transitions. [2024-11-06 14:23:15,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-06 14:23:15,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:15,165 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-06 14:23:15,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-06 14:23:15,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:15,366 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:15,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:15,366 INFO L85 PathProgramCache]: Analyzing trace with hash 387052583, now seen corresponding path program 1 times [2024-11-06 14:23:15,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:15,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [167832628] [2024-11-06 14:23:15,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:15,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:15,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:15,368 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:15,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-06 14:23:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:15,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 14:23:15,487 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:15,496 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-06 14:23:15,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:15,496 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:15,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167832628] [2024-11-06 14:23:15,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167832628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:15,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:15,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 14:23:15,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909367699] [2024-11-06 14:23:15,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:15,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 14:23:15,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:15,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 14:23:15,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 14:23:15,498 INFO L87 Difference]: Start difference. First operand 70 states and 93 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 14:23:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:15,518 INFO L93 Difference]: Finished difference Result 130 states and 180 transitions. [2024-11-06 14:23:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 14:23:15,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2024-11-06 14:23:15,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:15,520 INFO L225 Difference]: With dead ends: 130 [2024-11-06 14:23:15,520 INFO L226 Difference]: Without dead ends: 74 [2024-11-06 14:23:15,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 14:23:15,521 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:15,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 152 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 14:23:15,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-06 14:23:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2024-11-06 14:23:15,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-06 14:23:15,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2024-11-06 14:23:15,530 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 73 [2024-11-06 14:23:15,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:15,531 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2024-11-06 14:23:15,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-06 14:23:15,531 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2024-11-06 14:23:15,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-06 14:23:15,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:15,532 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:15,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-06 14:23:15,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:15,733 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:15,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1595103561, now seen corresponding path program 1 times [2024-11-06 14:23:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:15,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1291817364] [2024-11-06 14:23:15,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:15,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:15,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:15,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:15,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-06 14:23:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:15,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 14:23:15,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-06 14:23:15,899 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:15,899 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:15,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291817364] [2024-11-06 14:23:15,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291817364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:15,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:15,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 14:23:15,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966205671] [2024-11-06 14:23:15,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:15,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 14:23:15,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:15,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 14:23:15,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 14:23:15,900 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 14:23:15,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:15,945 INFO L93 Difference]: Finished difference Result 121 states and 161 transitions. [2024-11-06 14:23:15,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 14:23:15,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 81 [2024-11-06 14:23:15,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:15,946 INFO L225 Difference]: With dead ends: 121 [2024-11-06 14:23:15,946 INFO L226 Difference]: Without dead ends: 71 [2024-11-06 14:23:15,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 14:23:15,947 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:15,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 14:23:15,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-06 14:23:15,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-06 14:23:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.28) internal successors, (64), 53 states have internal predecessors, (64), 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 14:23:15,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2024-11-06 14:23:15,957 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 81 [2024-11-06 14:23:15,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:15,957 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2024-11-06 14:23:15,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 14:23:15,957 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2024-11-06 14:23:15,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-06 14:23:15,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:15,958 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:15,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-06 14:23:16,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:16,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:16,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:16,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1338639547, now seen corresponding path program 1 times [2024-11-06 14:23:16,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:16,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1728241854] [2024-11-06 14:23:16,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:16,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:16,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:16,161 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:16,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-06 14:23:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:16,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-06 14:23:16,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 14:23:16,348 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:16,348 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:16,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728241854] [2024-11-06 14:23:16,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728241854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:16,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:16,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 14:23:16,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431552566] [2024-11-06 14:23:16,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:16,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 14:23:16,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:16,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 14:23:16,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 14:23:16,349 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 14:23:16,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:16,455 INFO L93 Difference]: Finished difference Result 130 states and 169 transitions. [2024-11-06 14:23:16,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 14:23:16,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2024-11-06 14:23:16,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:16,456 INFO L225 Difference]: With dead ends: 130 [2024-11-06 14:23:16,456 INFO L226 Difference]: Without dead ends: 73 [2024-11-06 14:23:16,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-06 14:23:16,457 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 23 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:16,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 364 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 14:23:16,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-06 14:23:16,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2024-11-06 14:23:16,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 50 states have (on average 1.26) internal successors, (63), 53 states have internal predecessors, (63), 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 14:23:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2024-11-06 14:23:16,464 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 83 [2024-11-06 14:23:16,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:16,464 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2024-11-06 14:23:16,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 14:23:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2024-11-06 14:23:16,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-06 14:23:16,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:16,465 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:16,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-06 14:23:16,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:16,666 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:16,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:16,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1040869362, now seen corresponding path program 1 times [2024-11-06 14:23:16,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:16,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [429396437] [2024-11-06 14:23:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:16,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:16,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:16,668 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:16,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-06 14:23:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:16,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-06 14:23:16,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:16,878 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-06 14:23:16,878 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:16,879 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:16,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429396437] [2024-11-06 14:23:16,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429396437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:16,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:16,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-06 14:23:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795845364] [2024-11-06 14:23:16,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:16,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-06 14:23:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:16,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-06 14:23:16,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-06 14:23:16,880 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 14:23:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:17,045 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2024-11-06 14:23:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-06 14:23:17,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 85 [2024-11-06 14:23:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:17,046 INFO L225 Difference]: With dead ends: 130 [2024-11-06 14:23:17,046 INFO L226 Difference]: Without dead ends: 72 [2024-11-06 14:23:17,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-06 14:23:17,047 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 32 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:17,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 410 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 14:23:17,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-06 14:23:17,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 67. [2024-11-06 14:23:17,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 49 states have internal predecessors, (59), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-06 14:23:17,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2024-11-06 14:23:17,052 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 85 [2024-11-06 14:23:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:17,053 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2024-11-06 14:23:17,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 14:23:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2024-11-06 14:23:17,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-06 14:23:17,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:17,054 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:17,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-06 14:23:17,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:17,254 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:17,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:17,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1678268318, now seen corresponding path program 2 times [2024-11-06 14:23:17,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:17,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [721267319] [2024-11-06 14:23:17,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-06 14:23:17,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:17,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:17,257 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:17,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-06 14:23:17,407 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-06 14:23:17,407 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-06 14:23:17,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 14:23:17,414 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-06 14:23:17,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:17,443 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:17,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721267319] [2024-11-06 14:23:17,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721267319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:17,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:17,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 14:23:17,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454974147] [2024-11-06 14:23:17,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:17,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 14:23:17,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:17,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 14:23:17,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 14:23:17,445 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-06 14:23:17,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:17,482 INFO L93 Difference]: Finished difference Result 123 states and 161 transitions. [2024-11-06 14:23:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 14:23:17,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 94 [2024-11-06 14:23:17,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:17,484 INFO L225 Difference]: With dead ends: 123 [2024-11-06 14:23:17,484 INFO L226 Difference]: Without dead ends: 70 [2024-11-06 14:23:17,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 14:23:17,485 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:17,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 441 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 14:23:17,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-06 14:23:17,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-06 14:23:17,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 52 states have internal predecessors, (61), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (17), 12 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-06 14:23:17,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2024-11-06 14:23:17,496 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 94 [2024-11-06 14:23:17,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:17,496 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2024-11-06 14:23:17,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2024-11-06 14:23:17,497 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2024-11-06 14:23:17,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-06 14:23:17,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:17,497 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:23:17,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-06 14:23:17,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:17,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:17,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:17,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1005701739, now seen corresponding path program 1 times [2024-11-06 14:23:17,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:17,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1991582959] [2024-11-06 14:23:17,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:17,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:17,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:17,704 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:17,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-06 14:23:17,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:17,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-06 14:23:17,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:17,872 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-06 14:23:17,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:17,873 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:17,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991582959] [2024-11-06 14:23:17,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991582959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:17,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:17,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 14:23:17,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357648901] [2024-11-06 14:23:17,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:17,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 14:23:17,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:17,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 14:23:17,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 14:23:17,874 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 14:23:17,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:17,908 INFO L93 Difference]: Finished difference Result 119 states and 156 transitions. [2024-11-06 14:23:17,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 14:23:17,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 96 [2024-11-06 14:23:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:17,909 INFO L225 Difference]: With dead ends: 119 [2024-11-06 14:23:17,909 INFO L226 Difference]: Without dead ends: 70 [2024-11-06 14:23:17,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 14:23:17,910 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:17,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 440 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 14:23:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-06 14:23:17,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2024-11-06 14:23:17,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.25) internal successors, (60), 50 states have internal predecessors, (60), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2024-11-06 14:23:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2024-11-06 14:23:17,915 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 96 [2024-11-06 14:23:17,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:17,915 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2024-11-06 14:23:17,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 3 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 14:23:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2024-11-06 14:23:17,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-06 14:23:17,915 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:17,916 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:17,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-06 14:23:18,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:18,119 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:18,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:18,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1128444350, now seen corresponding path program 1 times [2024-11-06 14:23:18,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:18,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1952987504] [2024-11-06 14:23:18,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:18,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:18,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:18,122 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:18,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-06 14:23:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:18,256 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 14:23:18,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:18,301 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 8 treesize of output 1 [2024-11-06 14:23:18,303 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 8 treesize of output 1 [2024-11-06 14:23:22,578 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (select (select |c_#memory_$Pointer$#2.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) (_ bv0 64)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2024-11-06 14:23:22,765 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 41 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-06 14:23:22,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 14:23:23,074 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-06 14:23:23,075 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:23,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952987504] [2024-11-06 14:23:23,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952987504] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 14:23:23,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 14:23:23,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-11-06 14:23:23,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935728896] [2024-11-06 14:23:23,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 14:23:23,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-06 14:23:23,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:23,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-06 14:23:23,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=199, Unknown=1, NotChecked=28, Total=272 [2024-11-06 14:23:23,077 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 17 states have internal predecessors, (106), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-06 14:23:23,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:23,841 INFO L93 Difference]: Finished difference Result 166 states and 228 transitions. [2024-11-06 14:23:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 14:23:23,843 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 17 states have internal predecessors, (106), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) Word has length 98 [2024-11-06 14:23:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:23,844 INFO L225 Difference]: With dead ends: 166 [2024-11-06 14:23:23,844 INFO L226 Difference]: Without dead ends: 112 [2024-11-06 14:23:23,845 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 182 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=76, Invalid=347, Unknown=1, NotChecked=38, Total=462 [2024-11-06 14:23:23,845 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 60 mSDsluCounter, 561 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:23,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 635 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 312 Invalid, 1 Unknown, 268 Unchecked, 0.6s Time] [2024-11-06 14:23:23,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-06 14:23:23,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 86. [2024-11-06 14:23:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.28125) internal successors, (82), 66 states have internal predecessors, (82), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (16), 13 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-06 14:23:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2024-11-06 14:23:23,861 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 112 transitions. Word has length 98 [2024-11-06 14:23:23,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:23,861 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 112 transitions. [2024-11-06 14:23:23,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.235294117647059) internal successors, (106), 17 states have internal predecessors, (106), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (17), 5 states have call predecessors, (17), 5 states have call successors, (17) [2024-11-06 14:23:23,862 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 112 transitions. [2024-11-06 14:23:23,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-06 14:23:23,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:23,863 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:23,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-06 14:23:24,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:24,063 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:24,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 604075650, now seen corresponding path program 1 times [2024-11-06 14:23:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:24,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1826386084] [2024-11-06 14:23:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:24,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:24,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:24,066 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:24,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-06 14:23:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:24,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 14:23:24,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2024-11-06 14:23:24,218 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:24,218 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:24,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826386084] [2024-11-06 14:23:24,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826386084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:24,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:24,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 14:23:24,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953501414] [2024-11-06 14:23:24,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:24,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 14:23:24,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:24,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 14:23:24,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 14:23:24,224 INFO L87 Difference]: Start difference. First operand 86 states and 112 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-06 14:23:24,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:24,244 INFO L93 Difference]: Finished difference Result 159 states and 214 transitions. [2024-11-06 14:23:24,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 14:23:24,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-11-06 14:23:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:24,245 INFO L225 Difference]: With dead ends: 159 [2024-11-06 14:23:24,245 INFO L226 Difference]: Without dead ends: 87 [2024-11-06 14:23:24,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 14:23:24,246 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:24,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 14:23:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-06 14:23:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2024-11-06 14:23:24,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 64 states have (on average 1.265625) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (16), 13 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-06 14:23:24,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2024-11-06 14:23:24,257 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 98 [2024-11-06 14:23:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:24,258 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2024-11-06 14:23:24,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-06 14:23:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2024-11-06 14:23:24,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-06 14:23:24,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:24,259 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:24,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-06 14:23:24,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:24,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:24,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:24,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1924312770, now seen corresponding path program 1 times [2024-11-06 14:23:24,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:24,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [363283294] [2024-11-06 14:23:24,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:24,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:24,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:24,462 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:24,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-06 14:23:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:24,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 14:23:24,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-11-06 14:23:24,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:24,611 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:24,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363283294] [2024-11-06 14:23:24,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363283294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:24,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:24,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 14:23:24,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789502462] [2024-11-06 14:23:24,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:24,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 14:23:24,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:24,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 14:23:24,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 14:23:24,612 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-06 14:23:24,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:24,631 INFO L93 Difference]: Finished difference Result 158 states and 213 transitions. [2024-11-06 14:23:24,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 14:23:24,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 98 [2024-11-06 14:23:24,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:24,632 INFO L225 Difference]: With dead ends: 158 [2024-11-06 14:23:24,632 INFO L226 Difference]: Without dead ends: 86 [2024-11-06 14:23:24,633 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 14:23:24,633 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:24,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-06 14:23:24,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-06 14:23:24,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2024-11-06 14:23:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 63 states have internal predecessors, (76), 14 states have call successors, (14), 6 states have call predecessors, (14), 7 states have return successors, (16), 13 states have call predecessors, (16), 13 states have call successors, (16) [2024-11-06 14:23:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 106 transitions. [2024-11-06 14:23:24,638 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 106 transitions. Word has length 98 [2024-11-06 14:23:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:24,638 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 106 transitions. [2024-11-06 14:23:24,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-06 14:23:24,639 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 106 transitions. [2024-11-06 14:23:24,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 14:23:24,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:24,639 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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 14:23:24,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-06 14:23:24,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:24,840 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:24,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:24,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1438193982, now seen corresponding path program 1 times [2024-11-06 14:23:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:24,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1127945742] [2024-11-06 14:23:24,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:24,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:24,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:24,842 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:24,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-06 14:23:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:24,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-06 14:23:24,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:25,025 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 13 treesize of output 1 [2024-11-06 14:23:25,029 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 13 treesize of output 1 [2024-11-06 14:23:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 35 proven. 25 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 14:23:26,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 14:23:26,695 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 14:23:26,695 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:26,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127945742] [2024-11-06 14:23:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127945742] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 14:23:26,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 14:23:26,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2024-11-06 14:23:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351123822] [2024-11-06 14:23:26,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 14:23:26,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-06 14:23:26,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:26,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-06 14:23:26,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-11-06 14:23:26,697 INFO L87 Difference]: Start difference. First operand 83 states and 106 transitions. Second operand has 21 states, 21 states have (on average 6.0) internal successors, (126), 19 states have internal predecessors, (126), 10 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-06 14:23:31,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 14:23:35,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 14:23:39,384 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 14:23:43,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 14:23:47,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 14:23:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:49,166 INFO L93 Difference]: Finished difference Result 199 states and 251 transitions. [2024-11-06 14:23:49,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 14:23:49,167 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.0) internal successors, (126), 19 states have internal predecessors, (126), 10 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 100 [2024-11-06 14:23:49,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:49,168 INFO L225 Difference]: With dead ends: 199 [2024-11-06 14:23:49,168 INFO L226 Difference]: Without dead ends: 128 [2024-11-06 14:23:49,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 175 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=146, Invalid=666, Unknown=0, NotChecked=0, Total=812 [2024-11-06 14:23:49,169 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 101 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 47 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.0s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:49,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 707 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 391 Invalid, 5 Unknown, 0 Unchecked, 22.0s Time] [2024-11-06 14:23:49,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-06 14:23:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2024-11-06 14:23:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 96 states have (on average 1.21875) internal successors, (117), 98 states have internal predecessors, (117), 16 states have call successors, (16), 10 states have call predecessors, (16), 11 states have return successors, (19), 15 states have call predecessors, (19), 15 states have call successors, (19) [2024-11-06 14:23:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 152 transitions. [2024-11-06 14:23:49,180 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 152 transitions. Word has length 100 [2024-11-06 14:23:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:49,180 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 152 transitions. [2024-11-06 14:23:49,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0) internal successors, (126), 19 states have internal predecessors, (126), 10 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-06 14:23:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 152 transitions. [2024-11-06 14:23:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 14:23:49,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:49,182 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:49,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-06 14:23:49,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:49,382 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:49,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:49,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2047426688, now seen corresponding path program 1 times [2024-11-06 14:23:49,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:49,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [882397542] [2024-11-06 14:23:49,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:49,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:49,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:49,385 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:49,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-06 14:23:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:49,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-06 14:23:49,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:49,682 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 14:23:49,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 14:23:49,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2024-11-06 14:23:51,103 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-06 14:23:51,103 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:23:51,103 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:51,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882397542] [2024-11-06 14:23:51,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882397542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:23:51,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:23:51,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-06 14:23:51,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028710554] [2024-11-06 14:23:51,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:23:51,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-06 14:23:51,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:51,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-06 14:23:51,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-06 14:23:51,104 INFO L87 Difference]: Start difference. First operand 124 states and 152 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 14:23:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:23:52,609 INFO L93 Difference]: Finished difference Result 298 states and 371 transitions. [2024-11-06 14:23:52,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-06 14:23:52,610 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 100 [2024-11-06 14:23:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:23:52,611 INFO L225 Difference]: With dead ends: 298 [2024-11-06 14:23:52,611 INFO L226 Difference]: Without dead ends: 236 [2024-11-06 14:23:52,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-06 14:23:52,612 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 46 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 14:23:52,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 398 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 14:23:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-06 14:23:52,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-11-06 14:23:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 181 states have (on average 1.2265193370165746) internal successors, (222), 185 states have internal predecessors, (222), 30 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (36), 28 states have call predecessors, (36), 28 states have call successors, (36) [2024-11-06 14:23:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 288 transitions. [2024-11-06 14:23:52,650 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 288 transitions. Word has length 100 [2024-11-06 14:23:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:23:52,650 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 288 transitions. [2024-11-06 14:23:52,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 5 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 14:23:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 288 transitions. [2024-11-06 14:23:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 14:23:52,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:23:52,651 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:23:52,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-06 14:23:52,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:52,855 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:23:52,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:23:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1654399678, now seen corresponding path program 1 times [2024-11-06 14:23:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:23:52,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1973383951] [2024-11-06 14:23:52,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:23:52,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:23:52,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:23:52,858 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:23:52,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-06 14:23:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:23:53,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-06 14:23:53,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:23:53,078 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 13 treesize of output 1 [2024-11-06 14:23:53,083 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 13 treesize of output 1 [2024-11-06 14:23:55,295 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 32 proven. 28 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-06 14:23:55,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 14:23:56,590 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 10 proven. 33 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-06 14:23:56,590 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:23:56,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973383951] [2024-11-06 14:23:56,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973383951] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 14:23:56,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 14:23:56,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 25 [2024-11-06 14:23:56,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131818160] [2024-11-06 14:23:56,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 14:23:56,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-06 14:23:56,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:23:56,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-06 14:23:56,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=508, Unknown=0, NotChecked=0, Total=600 [2024-11-06 14:23:56,592 INFO L87 Difference]: Start difference. First operand 232 states and 288 transitions. Second operand has 25 states, 25 states have (on average 4.92) internal successors, (123), 23 states have internal predecessors, (123), 10 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-06 14:24:00,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 14:24:04,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 14:24:09,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-06 14:24:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:24:11,978 INFO L93 Difference]: Finished difference Result 352 states and 444 transitions. [2024-11-06 14:24:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-06 14:24:11,979 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 4.92) internal successors, (123), 23 states have internal predecessors, (123), 10 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) Word has length 100 [2024-11-06 14:24:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:24:11,980 INFO L225 Difference]: With dead ends: 352 [2024-11-06 14:24:11,980 INFO L226 Difference]: Without dead ends: 236 [2024-11-06 14:24:11,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 170 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=183, Invalid=873, Unknown=0, NotChecked=0, Total=1056 [2024-11-06 14:24:11,982 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 74 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 45 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.8s IncrementalHoareTripleChecker+Time [2024-11-06 14:24:11,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 963 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 659 Invalid, 3 Unknown, 0 Unchecked, 14.8s Time] [2024-11-06 14:24:11,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-06 14:24:12,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 232. [2024-11-06 14:24:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 181 states have (on average 1.2154696132596685) internal successors, (220), 185 states have internal predecessors, (220), 30 states have call successors, (30), 18 states have call predecessors, (30), 20 states have return successors, (36), 28 states have call predecessors, (36), 28 states have call successors, (36) [2024-11-06 14:24:12,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 286 transitions. [2024-11-06 14:24:12,005 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 286 transitions. Word has length 100 [2024-11-06 14:24:12,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:24:12,005 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 286 transitions. [2024-11-06 14:24:12,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 4.92) internal successors, (123), 23 states have internal predecessors, (123), 10 states have call successors, (19), 4 states have call predecessors, (19), 6 states have return successors, (18), 9 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-06 14:24:12,006 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 286 transitions. [2024-11-06 14:24:12,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 14:24:12,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:24:12,006 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:12,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-06 14:24:12,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:24:12,207 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:24:12,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:24:12,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1912565116, now seen corresponding path program 1 times [2024-11-06 14:24:12,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:24:12,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850862772] [2024-11-06 14:24:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:24:12,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:24:12,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:24:12,209 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:24:12,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-06 14:24:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:24:12,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-06 14:24:12,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:24:12,431 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 13 treesize of output 1 [2024-11-06 14:24:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-06 14:24:13,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 14:24:15,231 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 56 treesize of output 52 [2024-11-06 14:24:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 10 proven. 35 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-06 14:24:15,346 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:24:15,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850862772] [2024-11-06 14:24:15,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850862772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 14:24:15,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-06 14:24:15,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 29 [2024-11-06 14:24:15,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771188635] [2024-11-06 14:24:15,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-06 14:24:15,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-06 14:24:15,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:24:15,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-06 14:24:15,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2024-11-06 14:24:15,348 INFO L87 Difference]: Start difference. First operand 232 states and 286 transitions. Second operand has 29 states, 29 states have (on average 4.482758620689655) internal successors, (130), 27 states have internal predecessors, (130), 13 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-06 14:24:19,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:24:19,236 INFO L93 Difference]: Finished difference Result 586 states and 736 transitions. [2024-11-06 14:24:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-06 14:24:19,237 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 4.482758620689655) internal successors, (130), 27 states have internal predecessors, (130), 13 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) Word has length 100 [2024-11-06 14:24:19,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:24:19,239 INFO L225 Difference]: With dead ends: 586 [2024-11-06 14:24:19,239 INFO L226 Difference]: Without dead ends: 456 [2024-11-06 14:24:19,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 174 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=267, Invalid=1539, Unknown=0, NotChecked=0, Total=1806 [2024-11-06 14:24:19,241 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 185 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 14:24:19,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 1010 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 14:24:19,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-06 14:24:19,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 390. [2024-11-06 14:24:19,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 301 states have (on average 1.2192691029900333) internal successors, (367), 311 states have internal predecessors, (367), 52 states have call successors, (52), 28 states have call predecessors, (52), 36 states have return successors, (70), 50 states have call predecessors, (70), 48 states have call successors, (70) [2024-11-06 14:24:19,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 489 transitions. [2024-11-06 14:24:19,288 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 489 transitions. Word has length 100 [2024-11-06 14:24:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:24:19,288 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 489 transitions. [2024-11-06 14:24:19,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.482758620689655) internal successors, (130), 27 states have internal predecessors, (130), 13 states have call successors, (19), 3 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 12 states have call successors, (18) [2024-11-06 14:24:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 489 transitions. [2024-11-06 14:24:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 14:24:19,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:24:19,290 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:24:19,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-11-06 14:24:19,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:24:19,490 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:24:19,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:24:19,491 INFO L85 PathProgramCache]: Analyzing trace with hash 901447866, now seen corresponding path program 1 times [2024-11-06 14:24:19,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:24:19,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [160261723] [2024-11-06 14:24:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:24:19,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:24:19,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:24:19,492 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:24:19,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-06 14:24:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:24:19,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-06 14:24:19,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:24:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 14:24:19,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 14:24:19,771 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:24:19,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160261723] [2024-11-06 14:24:19,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160261723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 14:24:19,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 14:24:19,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 14:24:19,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107355177] [2024-11-06 14:24:19,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:24:19,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 14:24:19,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:24:19,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 14:24:19,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 14:24:19,772 INFO L87 Difference]: Start difference. First operand 390 states and 489 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 14:24:19,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:24:19,914 INFO L93 Difference]: Finished difference Result 839 states and 1079 transitions. [2024-11-06 14:24:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 14:24:19,914 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 100 [2024-11-06 14:24:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:24:19,916 INFO L225 Difference]: With dead ends: 839 [2024-11-06 14:24:19,916 INFO L226 Difference]: Without dead ends: 377 [2024-11-06 14:24:19,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-06 14:24:19,918 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 22 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 14:24:19,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 380 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 14:24:19,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-06 14:24:19,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-06 14:24:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 288 states have (on average 1.2013888888888888) internal successors, (346), 298 states have internal predecessors, (346), 52 states have call successors, (52), 28 states have call predecessors, (52), 36 states have return successors, (70), 50 states have call predecessors, (70), 48 states have call successors, (70) [2024-11-06 14:24:19,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 468 transitions. [2024-11-06 14:24:19,972 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 468 transitions. Word has length 100 [2024-11-06 14:24:19,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:24:19,973 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 468 transitions. [2024-11-06 14:24:19,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2024-11-06 14:24:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 468 transitions. [2024-11-06 14:24:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-06 14:24:19,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:24:19,974 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:24:19,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-06 14:24:20,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:24:20,174 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:24:20,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:24:20,175 INFO L85 PathProgramCache]: Analyzing trace with hash 364122814, now seen corresponding path program 1 times [2024-11-06 14:24:20,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:24:20,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551417261] [2024-11-06 14:24:20,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:24:20,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:24:20,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:24:20,176 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:24:20,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-06 14:24:20,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:24:20,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-06 14:24:20,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:24:20,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2024-11-06 14:24:20,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 1 [2024-11-06 14:24:20,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2024-11-06 14:24:20,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-06 14:24:20,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-06 14:24:20,738 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|))))) is different from true [2024-11-06 14:24:21,986 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|))))) (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|))) (let ((.cse2 (select .cse3 (_ bv24 64)))) (or (and (not (= (_ bv0 64) .cse2)) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base| v_DerPreprocessor_1) .cse2 v_DerPreprocessor_2) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) (_ bv24 64) .cse2) .cse3))) (and (not (= (_ bv0 64) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|)) (= .cse2 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|))) (let ((.cse4 (select .cse5 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (_ bv24 64) .cse4) .cse5)) (not (= (_ bv0 64) .cse4)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|)))))) is different from true [2024-11-06 14:24:24,957 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|))) (let ((.cse3 (select .cse2 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|) (_ bv24 64) .cse3))) (not (= (_ bv0 64) .cse3))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|))) (let ((.cse4 (select .cse5 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (_ bv24 64) .cse4) .cse5)) (not (= (_ bv0 64) .cse4)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|))) (let ((.cse6 (select .cse7 (_ bv24 64)))) (and (not (= .cse6 (_ bv0 64))) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse7 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|) (_ bv24 64) .cse6))))))))) is different from true [2024-11-06 14:24:26,217 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|))) (let ((.cse3 (select .cse2 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|) (_ bv24 64) .cse3))) (not (= (_ bv0 64) .cse3))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29| (_ BitVec 64))) (and (= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29|) (_ bv24 64))) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29|))) (let ((.cse4 (select .cse5 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29|) (_ bv24 64) .cse4) .cse5)) (not (= (_ bv0 64) .cse4))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|))) (let ((.cse6 (select .cse7 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (_ bv24 64) .cse6) .cse7)) (not (= (_ bv0 64) .cse6)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27| (_ BitVec 64))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|))) (let ((.cse8 (select .cse9 (_ bv24 64)))) (and (not (= .cse8 (_ bv0 64))) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27| v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|) (_ bv24 64) .cse8))))))))) is different from true [2024-11-06 14:24:28,490 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| (_ BitVec 64))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|))) (let ((.cse0 (select .cse1 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (_ bv24 64) .cse0) .cse1)) (not (= (_ bv0 64) .cse0)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_43|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28| (_ BitVec 64))) (let ((.cse2 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|))) (let ((.cse3 (select .cse2 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse2 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_28|) (_ bv24 64) .cse3))) (not (= (_ bv0 64) .cse3))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29| (_ BitVec 64))) (and (= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29|) (_ bv24 64))) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29| (_ BitVec 64))) (let ((.cse5 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29|))) (let ((.cse4 (select .cse5 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29| v_DerPreprocessor_1) .cse4 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_29|) (_ bv24 64) .cse4) .cse5)) (not (= (_ bv0 64) .cse4))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| (_ BitVec 64))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|))) (let ((.cse6 (select .cse7 (_ bv24 64)))) (and (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (_ bv24 64) .cse6) .cse7)) (not (= (_ bv0 64) .cse6)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_44|))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27| (_ BitVec 64))) (and (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|) (_ bv24 64)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|) (not (= (_ bv0 64) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27| (_ BitVec 64))) (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|))) (let ((.cse8 (select .cse9 (_ bv24 64)))) (and (not (= .cse8 (_ bv0 64))) (exists ((v_DerPreprocessor_2 (Array (_ BitVec 64) (_ BitVec 64))) (v_DerPreprocessor_1 (Array (_ BitVec 64) (_ BitVec 64)))) (= .cse9 (store (select (store (store |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27| v_DerPreprocessor_1) .cse8 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_27|) (_ bv24 64) .cse8)))))))) (or |c_aws_linked_list_is_valid_#t~short301#1| (= (_ bv0 64) (select (select |c_#memory_$Pointer$#2.base| |c_aws_linked_list_is_valid_#in~list#1.base|) (bvadd (_ bv24 64) |c_aws_linked_list_is_valid_#in~list#1.offset|))))) is different from true [2024-11-06 14:24:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 48 not checked. [2024-11-06 14:24:29,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 14:24:30,825 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2024-11-06 14:24:30,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 185 [2024-11-06 14:24:30,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2024-11-06 14:24:30,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-06 14:24:30,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 93 [2024-11-06 14:24:31,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-06 14:24:31,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-06 14:24:31,465 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 14:24:31,465 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-06 14:24:31,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551417261] [2024-11-06 14:24:31,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551417261] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 14:24:31,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 14:24:31,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [19] total 27 [2024-11-06 14:24:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569814558] [2024-11-06 14:24:31,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 14:24:31,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-06 14:24:31,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-06 14:24:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-06 14:24:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=372, Unknown=23, NotChecked=220, Total=702 [2024-11-06 14:24:31,466 INFO L87 Difference]: Start difference. First operand 377 states and 468 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 14:24:33,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 14:24:33,154 INFO L93 Difference]: Finished difference Result 503 states and 625 transitions. [2024-11-06 14:24:33,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 14:24:33,155 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 102 [2024-11-06 14:24:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 14:24:33,157 INFO L225 Difference]: With dead ends: 503 [2024-11-06 14:24:33,157 INFO L226 Difference]: Without dead ends: 380 [2024-11-06 14:24:33,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=103, Invalid=491, Unknown=26, NotChecked=250, Total=870 [2024-11-06 14:24:33,158 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 17 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 14:24:33,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 485 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 14:24:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2024-11-06 14:24:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 196. [2024-11-06 14:24:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 149 states have (on average 1.1879194630872483) internal successors, (177), 154 states have internal predecessors, (177), 27 states have call successors, (27), 15 states have call predecessors, (27), 19 states have return successors, (36), 26 states have call predecessors, (36), 25 states have call successors, (36) [2024-11-06 14:24:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 240 transitions. [2024-11-06 14:24:33,184 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 240 transitions. Word has length 102 [2024-11-06 14:24:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 14:24:33,184 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 240 transitions. [2024-11-06 14:24:33,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 5 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-06 14:24:33,184 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 240 transitions. [2024-11-06 14:24:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-06 14:24:33,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 14:24:33,185 INFO L215 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 14:24:33,201 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-11-06 14:24:33,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:24:33,386 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 14:24:33,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 14:24:33,386 INFO L85 PathProgramCache]: Analyzing trace with hash -2065682137, now seen corresponding path program 1 times [2024-11-06 14:24:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-06 14:24:33,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [564495988] [2024-11-06 14:24:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 14:24:33,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 14:24:33,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 14:24:33,388 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 14:24:33,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-06 14:24:33,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 14:24:33,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-06 14:24:33,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 14:24:33,748 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 18 treesize of output 7 [2024-11-06 14:24:33,757 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 18 treesize of output 7 [2024-11-06 14:24:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 51 proven. 40 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 14:24:39,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 14:24:48,946 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-06 14:24:50,177 INFO L349 Elim1Store]: treesize reduction 258, result has 48.5 percent of original size [2024-11-06 14:24:50,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 3360 treesize of output 2745