./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash f3fe3cb34379eae79cebbb54b4c78cc48acd108a8b9278d58db57418db83cfb2 --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:26:07,782 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:26:07,844 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:26:07,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:26:07,855 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:26:07,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:26:07,878 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:26:07,879 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:26:07,879 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:26:07,882 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:26:07,883 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:26:07,883 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:26:07,883 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:26:07,884 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:26:07,884 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:26:07,885 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:26:07,885 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:26:07,885 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:26:07,886 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:26:07,886 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:26:07,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:26:07,887 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:26:07,888 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:26:07,888 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:26:07,889 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:26:07,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:26:07,889 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:26:07,889 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:26:07,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:26:07,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:26:07,891 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:26:07,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:26:07,891 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:26:07,891 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:26:07,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:26:07,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:26:07,892 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:26:07,892 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:26:07,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:26:07,893 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3fe3cb34379eae79cebbb54b4c78cc48acd108a8b9278d58db57418db83cfb2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:26:08,119 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:26:08,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:26:08,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:26:08,159 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:26:08,160 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:26:08,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i [2023-11-23 07:26:09,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:26:09,595 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:26:09,595 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i [2023-11-23 07:26:09,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca3dd16f/ee9f0ab5b9034f75918fb04038745aa4/FLAG6ccfdcd4a [2023-11-23 07:26:09,640 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dca3dd16f/ee9f0ab5b9034f75918fb04038745aa4 [2023-11-23 07:26:09,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:26:09,645 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:26:09,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:26:09,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:26:09,653 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:26:09,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:26:09" (1/1) ... [2023-11-23 07:26:09,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b0806 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:09, skipping insertion in model container [2023-11-23 07:26:09,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:26:09" (1/1) ... [2023-11-23 07:26:09,758 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:26:09,951 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i[4495,4508] [2023-11-23 07:26:09,957 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i[4555,4568] [2023-11-23 07:26:10,421 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,422 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,422 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,423 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,427 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,438 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,443 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,445 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,445 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,446 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,447 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,447 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,448 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,605 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:26:10,606 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:26:10,607 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:26:10,608 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:26:10,609 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:26:10,609 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:26:10,609 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:26:10,610 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:26:10,610 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:26:10,611 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:26:10,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:26:10,769 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:26:10,795 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i[4495,4508] [2023-11-23 07:26:10,795 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_front_harness_negated.i[4555,4568] [2023-11-23 07:26:10,830 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,830 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,831 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,831 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,831 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,838 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,839 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,840 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,840 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,841 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,841 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,841 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,842 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:26:10,865 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:26:10,865 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:26:10,866 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:26:10,867 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:26:10,867 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:26:10,867 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:26:10,868 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:26:10,868 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:26:10,869 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:26:10,869 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:26:10,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:26:11,030 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,030 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,030 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,030 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,031 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,031 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,031 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,032 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,032 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,032 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,032 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,033 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,033 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,033 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,033 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,033 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:26:11,040 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:26:11,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11 WrapperNode [2023-11-23 07:26:11,041 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:26:11,042 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:26:11,043 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:26:11,043 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:26:11,048 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,107 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,145 INFO L138 Inliner]: procedures = 678, calls = 1045, calls flagged for inlining = 50, calls inlined = 5, statements flattened = 133 [2023-11-23 07:26:11,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:26:11,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:26:11,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:26:11,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:26:11,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,194 INFO L188 MemorySlicer]: Split 27 memory accesses to 3 slices as follows [2, 20, 5]. 74 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5]. The 6 writes are split as follows [0, 6, 0]. [2023-11-23 07:26:11,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,219 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,223 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,227 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:26:11,228 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:26:11,228 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:26:11,228 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:26:11,229 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (1/1) ... [2023-11-23 07:26:11,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:26:11,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:11,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 07:26:11,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 07:26:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:26:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:26:11,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:26:11,299 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:26:11,299 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:26:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 07:26:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 07:26:11,300 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 07:26:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:26:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:26:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:26:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:26:11,300 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_front [2023-11-23 07:26:11,301 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_front [2023-11-23 07:26:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:26:11,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:26:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2023-11-23 07:26:11,301 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2023-11-23 07:26:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:26:11,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:26:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:26:11,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:26:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:26:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:26:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:26:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:26:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:26:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 07:26:11,302 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 07:26:11,302 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:26:11,302 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:26:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:26:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:26:11,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:26:11,484 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:26:11,486 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:26:11,766 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:26:11,800 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:26:11,800 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 07:26:11,801 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:26:11 BoogieIcfgContainer [2023-11-23 07:26:11,801 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:26:11,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:26:11,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:26:11,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:26:11,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:26:09" (1/3) ... [2023-11-23 07:26:11,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7024d1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:26:11, skipping insertion in model container [2023-11-23 07:26:11,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:26:11" (2/3) ... [2023-11-23 07:26:11,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7024d1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:26:11, skipping insertion in model container [2023-11-23 07:26:11,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:26:11" (3/3) ... [2023-11-23 07:26:11,810 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_front_harness_negated.i [2023-11-23 07:26:11,823 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:26:11,823 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:26:11,866 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:26:11,875 INFO L357 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, mHoare=true, 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;@c68f771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:26:11,875 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:26:11,879 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-23 07:26:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 07:26:11,888 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:11,889 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:11,889 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:11,894 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:11,894 INFO L85 PathProgramCache]: Analyzing trace with hash 574091164, now seen corresponding path program 1 times [2023-11-23 07:26:11,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:11,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247569859] [2023-11-23 07:26:11,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:11,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:12,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:26:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:26:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:26:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:26:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 07:26:12,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 07:26:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-23 07:26:12,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:12,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247569859] [2023-11-23 07:26:12,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247569859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:12,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:26:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:26:12,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995550339] [2023-11-23 07:26:12,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:12,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:26:12,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:26:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:26:12,495 INFO L87 Difference]: Start difference. First operand has 87 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:26:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:12,560 INFO L93 Difference]: Finished difference Result 168 states and 251 transitions. [2023-11-23 07:26:12,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:26:12,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 79 [2023-11-23 07:26:12,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:12,570 INFO L225 Difference]: With dead ends: 168 [2023-11-23 07:26:12,570 INFO L226 Difference]: Without dead ends: 85 [2023-11-23 07:26:12,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:26:12,577 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:12,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-11-23 07:26:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-11-23 07:26:12,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 53 states have internal predecessors, (67), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-23 07:26:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 114 transitions. [2023-11-23 07:26:12,625 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 114 transitions. Word has length 79 [2023-11-23 07:26:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:12,626 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 114 transitions. [2023-11-23 07:26:12,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 07:26:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2023-11-23 07:26:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-11-23 07:26:12,635 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:12,635 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:12,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:26:12,636 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:12,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1316343588, now seen corresponding path program 1 times [2023-11-23 07:26:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000692012] [2023-11-23 07:26:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 07:26:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:12,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:12,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:13,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 07:26:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 07:26:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 07:26:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:13,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 07:26:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:13,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 07:26:13,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:13,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 07:26:13,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-11-23 07:26:13,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:13,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000692012] [2023-11-23 07:26:13,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000692012] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:13,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2020242047] [2023-11-23 07:26:13,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:13,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:13,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:13,215 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) [2023-11-23 07:26:13,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:26:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:13,462 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-23 07:26:13,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:13,619 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 22 treesize of output 7 [2023-11-23 07:26:13,623 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 24 treesize of output 9 [2023-11-23 07:26:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 42 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 07:26:14,789 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:21,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 162 [2023-11-23 07:26:21,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:21,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:21,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:21,614 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:21,728 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 07:26:21,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2020242047] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:21,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:26:21,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [6, 16] total 33 [2023-11-23 07:26:21,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243924740] [2023-11-23 07:26:21,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:21,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 07:26:21,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:21,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 07:26:21,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=948, Unknown=3, NotChecked=0, Total=1056 [2023-11-23 07:26:21,732 INFO L87 Difference]: Start difference. First operand 85 states and 114 transitions. Second operand has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-23 07:26:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:22,164 INFO L93 Difference]: Finished difference Result 155 states and 213 transitions. [2023-11-23 07:26:22,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 07:26:22,165 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) Word has length 79 [2023-11-23 07:26:22,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:22,166 INFO L225 Difference]: With dead ends: 155 [2023-11-23 07:26:22,166 INFO L226 Difference]: Without dead ends: 86 [2023-11-23 07:26:22,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 144 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=120, Invalid=1137, Unknown=3, NotChecked=0, Total=1260 [2023-11-23 07:26:22,168 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 8 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:22,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1043 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 07:26:22,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-11-23 07:26:22,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-11-23 07:26:22,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 54 states have internal predecessors, (68), 24 states have call successors, (24), 8 states have call predecessors, (24), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-23 07:26:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 115 transitions. [2023-11-23 07:26:22,186 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 115 transitions. Word has length 79 [2023-11-23 07:26:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:22,200 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 115 transitions. [2023-11-23 07:26:22,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 7 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (11), 7 states have call predecessors, (11), 7 states have call successors, (11) [2023-11-23 07:26:22,202 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 115 transitions. [2023-11-23 07:26:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 07:26:22,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:22,205 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:22,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:22,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:22,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:22,420 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:22,423 INFO L85 PathProgramCache]: Analyzing trace with hash 148280207, now seen corresponding path program 1 times [2023-11-23 07:26:22,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:22,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687719884] [2023-11-23 07:26:22,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:22,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:22,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:26:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:26:22,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:26:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 07:26:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:26:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:22,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 07:26:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:26:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-23 07:26:22,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:22,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687719884] [2023-11-23 07:26:22,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687719884] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:22,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984696177] [2023-11-23 07:26:22,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:22,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:22,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:22,733 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) [2023-11-23 07:26:22,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:26:22,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:22,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-23 07:26:22,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:22,881 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 6 treesize of output 5 [2023-11-23 07:26:22,979 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 24 treesize of output 9 [2023-11-23 07:26:22,986 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 19 [2023-11-23 07:26:23,034 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 07:26:23,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-23 07:26:23,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:23,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:23,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 07:26:23,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-23 07:26:23,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:23,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 28 [2023-11-23 07:26:23,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-23 07:26:23,133 INFO L349 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-11-23 07:26:23,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 127 [2023-11-23 07:26:23,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:23,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:23,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 87 [2023-11-23 07:26:23,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:23,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2023-11-23 07:26:23,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 07:26:26,349 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 9 refuted. 4 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 07:26:26,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:26:26,772 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_212 Int) (v_ArrVal_213 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_213))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_212))) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_215 (Array Int Int)) (v_ArrVal_211 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_215))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_211))) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 07:26:26,883 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:26,884 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:26,937 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:26:26,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 299 treesize of output 286 [2023-11-23 07:26:26,965 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:26,966 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:27,038 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:26:27,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 357 treesize of output 344 [2023-11-23 07:26:27,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:27,061 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 288 treesize of output 270 [2023-11-23 07:26:27,070 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 237 treesize of output 225 [2023-11-23 07:26:27,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:27,085 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 326 treesize of output 324 [2023-11-23 07:26:27,095 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 283 treesize of output 271 [2023-11-23 07:26:27,120 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 [2023-11-23 07:26:28,204 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 7 treesize of output 3 [2023-11-23 07:26:28,387 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:26:28,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:28,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 411 treesize of output 403 [2023-11-23 07:26:28,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:26:28,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 498 treesize of output 464 [2023-11-23 07:26:29,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984696177] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:29,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:26:29,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 16] total 21 [2023-11-23 07:26:29,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677319556] [2023-11-23 07:26:29,672 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:26:29,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-23 07:26:29,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:29,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-23 07:26:29,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=683, Unknown=47, NotChecked=54, Total=870 [2023-11-23 07:26:29,677 INFO L87 Difference]: Start difference. First operand 86 states and 115 transitions. Second operand has 21 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 9 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2023-11-23 07:26:38,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:26:41,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:26:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:42,507 INFO L93 Difference]: Finished difference Result 201 states and 271 transitions. [2023-11-23 07:26:42,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-23 07:26:42,508 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 9 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) Word has length 80 [2023-11-23 07:26:42,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:42,511 INFO L225 Difference]: With dead ends: 201 [2023-11-23 07:26:42,511 INFO L226 Difference]: Without dead ends: 126 [2023-11-23 07:26:42,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=239, Invalid=2076, Unknown=139, NotChecked=96, Total=2550 [2023-11-23 07:26:42,513 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 176 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 18 mSolverCounterUnsat, 153 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 153 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:42,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1258 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 587 Invalid, 153 Unknown, 0 Unchecked, 9.5s Time] [2023-11-23 07:26:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-23 07:26:42,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2023-11-23 07:26:42,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2839506172839505) internal successors, (104), 84 states have internal predecessors, (104), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (31), 26 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-23 07:26:42,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 164 transitions. [2023-11-23 07:26:42,533 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 164 transitions. Word has length 80 [2023-11-23 07:26:42,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:42,534 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 164 transitions. [2023-11-23 07:26:42,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 4.647058823529412) internal successors, (79), 17 states have internal predecessors, (79), 9 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (21), 7 states have call predecessors, (21), 8 states have call successors, (21) [2023-11-23 07:26:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 164 transitions. [2023-11-23 07:26:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 07:26:42,536 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:42,536 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:42,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 07:26:42,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-23 07:26:42,737 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:42,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:42,737 INFO L85 PathProgramCache]: Analyzing trace with hash -610702208, now seen corresponding path program 1 times [2023-11-23 07:26:42,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:42,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117324501] [2023-11-23 07:26:42,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:42,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:26:42,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 07:26:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 07:26:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:26:43,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-11-23 07:26:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:26:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-23 07:26:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,044 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2023-11-23 07:26:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:43,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117324501] [2023-11-23 07:26:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117324501] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:43,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675098948] [2023-11-23 07:26:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:43,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:43,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:43,061 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) [2023-11-23 07:26:43,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:26:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,228 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 07:26:43,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:43,314 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 07:26:43,314 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:43,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675098948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:43,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:43,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2023-11-23 07:26:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142916012] [2023-11-23 07:26:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:43,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:26:43,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:43,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:26:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 07:26:43,316 INFO L87 Difference]: Start difference. First operand 124 states and 164 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 07:26:43,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:43,455 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2023-11-23 07:26:43,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:26:43,455 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 83 [2023-11-23 07:26:43,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:43,459 INFO L225 Difference]: With dead ends: 202 [2023-11-23 07:26:43,461 INFO L226 Difference]: Without dead ends: 124 [2023-11-23 07:26:43,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2023-11-23 07:26:43,464 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 43 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:43,466 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 561 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:43,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-23 07:26:43,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2023-11-23 07:26:43,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 81 states have (on average 1.2592592592592593) internal successors, (102), 84 states have internal predecessors, (102), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (31), 26 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-23 07:26:43,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 162 transitions. [2023-11-23 07:26:43,485 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 162 transitions. Word has length 83 [2023-11-23 07:26:43,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:43,486 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 162 transitions. [2023-11-23 07:26:43,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 07:26:43,486 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 162 transitions. [2023-11-23 07:26:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 07:26:43,488 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:43,488 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:43,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:43,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:43,700 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:43,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:43,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1253135930, now seen corresponding path program 1 times [2023-11-23 07:26:43,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:43,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703622712] [2023-11-23 07:26:43,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:43,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:43,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:43,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:26:43,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:43,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:26:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:26:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 07:26:43,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:26:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:43,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 07:26:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-23 07:26:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:43,940 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-11-23 07:26:43,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703622712] [2023-11-23 07:26:43,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703622712] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:43,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702324874] [2023-11-23 07:26:43,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:43,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:43,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:43,957 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) [2023-11-23 07:26:43,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:26:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-23 07:26:44,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 07:26:44,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:44,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702324874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:44,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:44,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2023-11-23 07:26:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471620866] [2023-11-23 07:26:44,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:44,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:26:44,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:44,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:26:44,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:26:44,203 INFO L87 Difference]: Start difference. First operand 124 states and 162 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 07:26:44,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:44,381 INFO L93 Difference]: Finished difference Result 210 states and 279 transitions. [2023-11-23 07:26:44,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:26:44,381 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 84 [2023-11-23 07:26:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:44,383 INFO L225 Difference]: With dead ends: 210 [2023-11-23 07:26:44,383 INFO L226 Difference]: Without dead ends: 130 [2023-11-23 07:26:44,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-11-23 07:26:44,384 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 65 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:44,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 629 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:26:44,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-23 07:26:44,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 125. [2023-11-23 07:26:44,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.2439024390243902) internal successors, (102), 85 states have internal predecessors, (102), 29 states have call successors, (29), 13 states have call predecessors, (29), 13 states have return successors, (31), 26 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-23 07:26:44,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 162 transitions. [2023-11-23 07:26:44,402 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 162 transitions. Word has length 84 [2023-11-23 07:26:44,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:44,403 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 162 transitions. [2023-11-23 07:26:44,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 4 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 07:26:44,403 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 162 transitions. [2023-11-23 07:26:44,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-23 07:26:44,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:44,404 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:44,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:44,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:44,617 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:44,617 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:44,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1965915557, now seen corresponding path program 1 times [2023-11-23 07:26:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:44,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566492481] [2023-11-23 07:26:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:44,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-23 07:26:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-23 07:26:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 07:26:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 07:26:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:26:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 07:26:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:26:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-11-23 07:26:44,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:44,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566492481] [2023-11-23 07:26:44,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566492481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:44,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102878889] [2023-11-23 07:26:44,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:44,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:44,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:44,898 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) [2023-11-23 07:26:44,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 07:26:45,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,056 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 07:26:45,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 07:26:45,069 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:26:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102878889] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:26:45,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:26:45,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-11-23 07:26:45,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848876492] [2023-11-23 07:26:45,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:26:45,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 07:26:45,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:26:45,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 07:26:45,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:26:45,072 INFO L87 Difference]: Start difference. First operand 125 states and 162 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-23 07:26:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:26:45,105 INFO L93 Difference]: Finished difference Result 202 states and 270 transitions. [2023-11-23 07:26:45,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 07:26:45,106 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 86 [2023-11-23 07:26:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:26:45,108 INFO L225 Difference]: With dead ends: 202 [2023-11-23 07:26:45,108 INFO L226 Difference]: Without dead ends: 125 [2023-11-23 07:26:45,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:26:45,109 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:26:45,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 199 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:26:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-23 07:26:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2023-11-23 07:26:45,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.2467532467532467) internal successors, (96), 79 states have internal predecessors, (96), 29 states have call successors, (29), 13 states have call predecessors, (29), 12 states have return successors, (30), 26 states have call predecessors, (30), 28 states have call successors, (30) [2023-11-23 07:26:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 155 transitions. [2023-11-23 07:26:45,141 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 155 transitions. Word has length 86 [2023-11-23 07:26:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:26:45,142 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 155 transitions. [2023-11-23 07:26:45,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-11-23 07:26:45,142 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 155 transitions. [2023-11-23 07:26:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-23 07:26:45,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:26:45,143 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:26:45,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 07:26:45,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:45,356 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:26:45,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:26:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1971582654, now seen corresponding path program 1 times [2023-11-23 07:26:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:26:45,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979732051] [2023-11-23 07:26:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:45,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:26:45,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:45,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 07:26:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:26:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-23 07:26:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 07:26:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 07:26:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 07:26:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 07:26:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:26:45,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 07:26:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 07:26:45,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2023-11-23 07:26:45,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:26:45,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979732051] [2023-11-23 07:26:45,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979732051] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:26:45,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522486691] [2023-11-23 07:26:45,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:26:45,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:26:45,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:26:45,584 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) [2023-11-23 07:26:45,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 07:26:45,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:26:45,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-23 07:26:45,748 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:26:45,752 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 6 treesize of output 5 [2023-11-23 07:26:45,857 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 24 treesize of output 9 [2023-11-23 07:26:45,862 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 19 [2023-11-23 07:26:45,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:45,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:45,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-23 07:26:45,920 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 07:26:45,921 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 24 [2023-11-23 07:26:45,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 07:26:45,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:45,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2023-11-23 07:26:45,950 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-23 07:26:45,951 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 22 [2023-11-23 07:26:45,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:45,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-11-23 07:26:45,978 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 07:26:45,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2023-11-23 07:26:46,055 INFO L349 Elim1Store]: treesize reduction 50, result has 18.0 percent of original size [2023-11-23 07:26:46,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 119 treesize of output 127 [2023-11-23 07:26:46,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:46,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:46,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 87 [2023-11-23 07:26:46,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 07:26:46,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2023-11-23 07:26:46,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-11-23 07:27:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 4 proven. 21 refuted. 51 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:27:22,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:27:23,243 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_697 Int) (v_ArrVal_702 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_702))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_697))) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_700 (Array Int Int)) (v_ArrVal_698 Int)) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_700))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_698))) |c_ULTIMATE.start_aws_linked_list_front_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 07:27:23,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:27:23,415 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:27:23,460 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:27:23,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 173 treesize of output 202 [2023-11-23 07:27:23,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:27:23,471 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:27:23,528 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 07:27:23,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 223 treesize of output 252 [2023-11-23 07:27:23,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:23,542 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 280 treesize of output 266 [2023-11-23 07:27:23,571 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 233 treesize of output 221 [2023-11-23 07:27:23,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:23,584 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 322 treesize of output 320 [2023-11-23 07:27:23,594 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 279 treesize of output 267 [2023-11-23 07:27:23,612 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 [2023-11-23 07:27:24,043 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 [2023-11-23 07:27:24,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:24,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 416 treesize of output 402 [2023-11-23 07:27:24,614 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 07:27:24,623 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:27:24,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 395 treesize of output 371 [2023-11-23 07:27:25,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522486691] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:27:25,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:27:25,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 24] total 30 [2023-11-23 07:27:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390954682] [2023-11-23 07:27:25,600 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 07:27:25,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-23 07:27:25,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:27:25,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-23 07:27:25,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1126, Unknown=147, NotChecked=72, Total=1482 [2023-11-23 07:27:25,602 INFO L87 Difference]: Start difference. First operand 119 states and 155 transitions. Second operand has 30 states, 24 states have (on average 4.458333333333333) internal successors, (107), 24 states have internal predecessors, (107), 15 states have call successors, (26), 11 states have call predecessors, (26), 11 states have return successors, (23), 13 states have call predecessors, (23), 14 states have call successors, (23) [2023-11-23 07:27:36,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:40,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:45,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:27:51,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:10,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:15,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:24,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:33,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:43,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:55,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:28:58,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:00,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:02,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:11,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:14,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:26,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:35,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:39,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:42,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:45,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:49,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:52,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:55,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:29:59,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:02,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:05,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:16,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:19,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:22,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:32,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 07:30:36,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15