./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i --full-output --preprocessor.use.memory.slicer false --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_rend_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 f24a61d23dc63fa137ac17d2eae1e2d1b68ccac0bb4c672bf225a31504faa393 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:54:57,835 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:54:57,881 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:54:57,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:54:57,888 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:54:57,902 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:54:57,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:54:57,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:54:57,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:54:57,910 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:54:57,910 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:54:57,911 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:54:57,911 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:54:57,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:54:57,912 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:54:57,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:54:57,913 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:54:57,913 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:54:57,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:54:57,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:54:57,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:54:57,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:54:57,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:54:57,915 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:54:57,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:54:57,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:54:57,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:54:57,916 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:54:57,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:54:57,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:54:57,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:54:57,917 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:54:57,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:54:57,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:54:57,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:54:57,918 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:54:57,928 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:54:57,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:54:57,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:54:57,929 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 -> f24a61d23dc63fa137ac17d2eae1e2d1b68ccac0bb4c672bf225a31504faa393 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:54:58,155 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:54:58,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:54:58,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:54:58,179 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:54:58,180 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:54:58,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i [2023-11-23 08:54:59,251 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:54:59,641 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:54:59,641 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_rend_harness_negated.i [2023-11-23 08:54:59,668 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae12c35cf/e1f9489434894bcc881266239768b9be/FLAGd923e8000 [2023-11-23 08:54:59,682 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae12c35cf/e1f9489434894bcc881266239768b9be [2023-11-23 08:54:59,686 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:54:59,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:54:59,692 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:54:59,693 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:54:59,696 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:54:59,697 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:54:59" (1/1) ... [2023-11-23 08:54:59,698 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39146bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:54:59, skipping insertion in model container [2023-11-23 08:54:59,698 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:54:59" (1/1) ... [2023-11-23 08:54:59,773 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:54:59,940 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_rend_harness_negated.i[4494,4507] [2023-11-23 08:54:59,946 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_rend_harness_negated.i[4554,4567] [2023-11-23 08:55:00,432 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,433 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,433 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,434 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,434 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,442 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,443 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,444 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,444 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,445 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,446 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,446 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,447 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,677 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:55:00,682 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:55:00,683 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:55:00,683 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:55:00,686 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:55:00,690 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:55:00,692 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:55:00,693 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:55:00,693 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:55:00,694 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:55:00,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:55:00,866 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:55:00,875 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_rend_harness_negated.i[4494,4507] [2023-11-23 08:55:00,876 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_rend_harness_negated.i[4554,4567] [2023-11-23 08:55:00,935 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,938 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,939 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,939 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,940 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,955 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,956 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,957 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,958 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,958 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,959 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,962 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:00,963 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:55:01,008 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:55:01,009 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:55:01,010 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:55:01,010 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:55:01,011 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:55:01,016 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:55:01,016 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:55:01,017 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:55:01,017 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:55:01,017 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:55:01,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:55:01,220 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,248 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,248 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,248 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,248 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,248 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,248 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,248 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,248 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,248 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,248 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,249 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,249 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,249 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,249 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,249 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:55:01,254 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:55:01,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01 WrapperNode [2023-11-23 08:55:01,255 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:55:01,256 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:55:01,256 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:55:01,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:55:01,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,338 INFO L138 Inliner]: procedures = 678, calls = 1040, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 135 [2023-11-23 08:55:01,338 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:55:01,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:55:01,339 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:55:01,339 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:55:01,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,354 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,355 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,372 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,374 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,378 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:55:01,379 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:55:01,379 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:55:01,379 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:55:01,380 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (1/1) ... [2023-11-23 08:55:01,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:55:01,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:01,426 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 08:55:01,448 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 08:55:01,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:55:01,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:55:01,476 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:55:01,476 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:55:01,476 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:55:01,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:55:01,476 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:55:01,476 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:55:01,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:55:01,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:55:01,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:55:01,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:55:01,477 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:55:01,478 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:55:01,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:55:01,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:55:01,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:55:01,478 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:55:01,478 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:55:01,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:55:01,661 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:55:01,665 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:55:01,894 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:55:01,935 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:55:01,935 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:55:01,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:01 BoogieIcfgContainer [2023-11-23 08:55:01,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:55:01,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:55:01,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:55:01,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:55:01,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:54:59" (1/3) ... [2023-11-23 08:55:01,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d72ebda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:01, skipping insertion in model container [2023-11-23 08:55:01,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:55:01" (2/3) ... [2023-11-23 08:55:01,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d72ebda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:55:01, skipping insertion in model container [2023-11-23 08:55:01,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:55:01" (3/3) ... [2023-11-23 08:55:01,942 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rend_harness_negated.i [2023-11-23 08:55:01,955 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:55:01,955 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:55:01,990 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:55:01,999 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;@7bf827e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:55:01,999 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:55:02,003 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-23 08:55:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:55:02,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:02,012 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:02,012 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:02,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:02,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1381970591, now seen corresponding path program 1 times [2023-11-23 08:55:02,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:02,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61691189] [2023-11-23 08:55:02,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:02,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:55:02,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:55:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:55:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:55:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,482 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-11-23 08:55:02,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:02,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61691189] [2023-11-23 08:55:02,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61691189] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:55:02,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:55:02,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:55:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612603533] [2023-11-23 08:55:02,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:02,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:55:02,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:02,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:55:02,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:55:02,524 INFO L87 Difference]: Start difference. First operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 40 states have internal predecessors, (56), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:55:02,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:02,570 INFO L93 Difference]: Finished difference Result 112 states and 168 transitions. [2023-11-23 08:55:02,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:55:02,572 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 08:55:02,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:02,578 INFO L225 Difference]: With dead ends: 112 [2023-11-23 08:55:02,578 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 08:55:02,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 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 08:55:02,588 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:02,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:55:02,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 08:55:02,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-23 08:55:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.3421052631578947) internal successors, (51), 39 states have internal predecessors, (51), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 08:55:02,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 76 transitions. [2023-11-23 08:55:02,625 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 76 transitions. Word has length 65 [2023-11-23 08:55:02,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:02,625 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 76 transitions. [2023-11-23 08:55:02,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:55:02,626 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2023-11-23 08:55:02,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:55:02,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:02,628 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:02,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:55:02,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:02,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:02,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1499718043, now seen corresponding path program 1 times [2023-11-23 08:55:02,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:02,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314311941] [2023-11-23 08:55:02,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:02,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:02,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:02,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:55:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:03,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:55:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:03,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:55:03,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:03,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:55:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:55:03,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:03,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314311941] [2023-11-23 08:55:03,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314311941] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:03,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514917405] [2023-11-23 08:55:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:03,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:03,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:03,081 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 08:55:03,100 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 08:55:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:03,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-23 08:55:03,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:03,318 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 08:55:03,335 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 08:55:03,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:03,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:03,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:03,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-11-23 08:55:03,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:03,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:03,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:03,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2023-11-23 08:55:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:55:03,927 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:55:03,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514917405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:55:03,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:55:03,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2023-11-23 08:55:03,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33774148] [2023-11-23 08:55:03,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:03,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:55:03,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:03,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:55:03,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:55:03,930 INFO L87 Difference]: Start difference. First operand 57 states and 76 transitions. Second operand has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:55:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:04,412 INFO L93 Difference]: Finished difference Result 157 states and 214 transitions. [2023-11-23 08:55:04,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:55:04,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:55:04,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:04,416 INFO L225 Difference]: With dead ends: 157 [2023-11-23 08:55:04,416 INFO L226 Difference]: Without dead ends: 110 [2023-11-23 08:55:04,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:55:04,417 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 71 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:04,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 306 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:55:04,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2023-11-23 08:55:04,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2023-11-23 08:55:04,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 73 states have (on average 1.36986301369863) internal successors, (100), 76 states have internal predecessors, (100), 24 states have call successors, (24), 9 states have call predecessors, (24), 10 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2023-11-23 08:55:04,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 148 transitions. [2023-11-23 08:55:04,435 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 148 transitions. Word has length 65 [2023-11-23 08:55:04,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:04,436 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 148 transitions. [2023-11-23 08:55:04,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:55:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 148 transitions. [2023-11-23 08:55:04,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:55:04,445 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:04,445 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:04,462 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 08:55:04,656 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 08:55:04,657 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:04,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:04,657 INFO L85 PathProgramCache]: Analyzing trace with hash -549669799, now seen corresponding path program 1 times [2023-11-23 08:55:04,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:04,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505213593] [2023-11-23 08:55:04,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:04,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:04,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:04,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:04,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:04,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:55:04,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:04,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:55:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:04,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:55:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:04,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:55:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:04,850 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:55:04,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:04,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505213593] [2023-11-23 08:55:04,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505213593] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:04,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291030137] [2023-11-23 08:55:04,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:04,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:04,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:04,854 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 08:55:04,883 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 08:55:05,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:05,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 08:55:05,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:05,067 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 08:55:05,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2023-11-23 08:55:05,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:05,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:05,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:05,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2023-11-23 08:55:05,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:05,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:05,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:05,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-11-23 08:55:05,948 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:55:05,949 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:55:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291030137] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:55:05,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:55:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2023-11-23 08:55:05,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861418496] [2023-11-23 08:55:05,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:05,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:55:05,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:55:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:55:05,951 INFO L87 Difference]: Start difference. First operand 108 states and 148 transitions. Second operand has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:55:06,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:06,501 INFO L93 Difference]: Finished difference Result 157 states and 211 transitions. [2023-11-23 08:55:06,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:55:06,502 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 08:55:06,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:06,503 INFO L225 Difference]: With dead ends: 157 [2023-11-23 08:55:06,503 INFO L226 Difference]: Without dead ends: 108 [2023-11-23 08:55:06,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 67 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:55:06,504 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:06,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 303 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 08:55:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-23 08:55:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-11-23 08:55:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 74 states have internal predecessors, (98), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 08:55:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 144 transitions. [2023-11-23 08:55:06,528 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 144 transitions. Word has length 65 [2023-11-23 08:55:06,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:06,528 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 144 transitions. [2023-11-23 08:55:06,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.555555555555555) internal successors, (50), 10 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:55:06,529 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 144 transitions. [2023-11-23 08:55:06,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:55:06,529 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:06,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:06,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:55:06,730 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 08:55:06,730 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:06,730 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:06,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1296976811, now seen corresponding path program 1 times [2023-11-23 08:55:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:06,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745746883] [2023-11-23 08:55:06,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:06,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:06,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:06,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:06,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:06,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:06,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:55:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:06,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:55:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:06,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:55:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:06,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:55:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:55:07,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:07,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745746883] [2023-11-23 08:55:07,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745746883] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:07,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660183048] [2023-11-23 08:55:07,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:07,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:07,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:07,008 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 08:55:07,015 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 08:55:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:07,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-23 08:55:07,157 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:07,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-23 08:55:07,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:07,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2023-11-23 08:55:07,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 34 [2023-11-23 08:55:07,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:55:09,325 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse1 .cse0) .cse2))))))))) is different from true [2023-11-23 08:55:16,631 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse1 .cse0) .cse2)) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| .cse0))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse4 .cse3) .cse5))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) .cse7 .cse6) .cse8)) (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| .cse6))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|)))))) is different from true [2023-11-23 08:55:17,692 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) .cse1 .cse0) .cse2)) (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| .cse0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse4 .cse3) .cse5)) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| .cse3))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| .cse6) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse7 .cse6) .cse8))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) .cse10 .cse9) .cse11)) (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| .cse9))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|)))))) is different from true [2023-11-23 08:55:20,457 WARN L876 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|)))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| Int)) (let ((.cse2 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|)) (.cse1 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_3| 24))) (let ((.cse0 (select .cse2 .cse1))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| v_DerPreprocessor_1) .cse0 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3|) .cse1 .cse0) .cse2)) (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_3| .cse0)))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse5 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)) (.cse4 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse3 (select .cse5 .cse4))) (and (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4| v_DerPreprocessor_1) .cse3 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|) .cse4 .cse3) .cse5)))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_4|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (let ((.cse8 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)) (.cse7 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24))) (let ((.cse6 (select .cse8 .cse7))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| v_DerPreprocessor_1) .cse6 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) .cse7 .cse6) .cse8)) (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| .cse6))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_11| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_11|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24)))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| Int)) (let ((.cse11 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|)) (.cse10 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_10| 24))) (let ((.cse9 (select .cse11 .cse10))) (and (<= |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10| v_DerPreprocessor_1) .cse9 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_10|) .cse10 .cse9) .cse11))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| Int)) (let ((.cse14 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|)) (.cse13 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| 24))) (let ((.cse12 (select .cse14 .cse13))) (and (exists ((v_DerPreprocessor_1 (Array Int Int)) (v_DerPreprocessor_2 (Array Int Int))) (= (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| v_DerPreprocessor_1) .cse12 v_DerPreprocessor_2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) .cse13 .cse12) .cse14)) (<= |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| .cse12))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| Int)) (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|) (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_2| 24)) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_2|)))))) is different from true [2023-11-23 08:55:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 37 not checked. [2023-11-23 08:55:22,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:55:22,351 INFO L349 Elim1Store]: treesize reduction 19, result has 62.0 percent of original size [2023-11-23 08:55:22,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 98 [2023-11-23 08:55:22,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:22,360 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 90 treesize of output 92 [2023-11-23 08:55:22,364 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 33 treesize of output 29 [2023-11-23 08:55:22,382 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 08:55:22,395 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 56 treesize of output 48 [2023-11-23 08:55:22,662 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:55:22,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660183048] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:22,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:55:22,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6, 19] total 31 [2023-11-23 08:55:22,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266864630] [2023-11-23 08:55:22,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:22,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:55:22,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:22,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:55:22,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=605, Unknown=18, NotChecked=212, Total=930 [2023-11-23 08:55:22,664 INFO L87 Difference]: Start difference. First operand 106 states and 144 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:55:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:24,149 INFO L93 Difference]: Finished difference Result 180 states and 255 transitions. [2023-11-23 08:55:24,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:55:24,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:55:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:24,151 INFO L225 Difference]: With dead ends: 180 [2023-11-23 08:55:24,151 INFO L226 Difference]: Without dead ends: 122 [2023-11-23 08:55:24,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=118, Invalid=809, Unknown=19, NotChecked=244, Total=1190 [2023-11-23 08:55:24,153 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 57 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:24,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 362 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:55:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-23 08:55:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2023-11-23 08:55:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 76 states have internal predecessors, (100), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 08:55:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 146 transitions. [2023-11-23 08:55:24,163 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 146 transitions. Word has length 65 [2023-11-23 08:55:24,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:24,163 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 146 transitions. [2023-11-23 08:55:24,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:55:24,164 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 146 transitions. [2023-11-23 08:55:24,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:55:24,165 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:24,165 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:24,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-23 08:55:24,376 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 08:55:24,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:24,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:24,377 INFO L85 PathProgramCache]: Analyzing trace with hash -271204209, now seen corresponding path program 1 times [2023-11-23 08:55:24,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:24,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906188584] [2023-11-23 08:55:24,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:24,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:24,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:24,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:24,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:24,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:55:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:24,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:55:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:24,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:55:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:24,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:55:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:24,528 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2023-11-23 08:55:24,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:24,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906188584] [2023-11-23 08:55:24,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906188584] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:24,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504592955] [2023-11-23 08:55:24,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:24,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:24,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:24,530 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 08:55:24,531 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 08:55:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:24,657 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-23 08:55:24,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:24,692 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 08:55:24,704 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 08:55:24,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:24,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:24,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:24,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2023-11-23 08:55:24,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:24,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:24,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:24,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2023-11-23 08:55:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:55:25,466 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:55:25,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504592955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:55:25,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:55:25,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2023-11-23 08:55:25,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24683066] [2023-11-23 08:55:25,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:25,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:55:25,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:25,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:55:25,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:55:25,468 INFO L87 Difference]: Start difference. First operand 108 states and 146 transitions. Second operand has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:55:26,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:26,141 INFO L93 Difference]: Finished difference Result 178 states and 242 transitions. [2023-11-23 08:55:26,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 08:55:26,142 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2023-11-23 08:55:26,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:26,143 INFO L225 Difference]: With dead ends: 178 [2023-11-23 08:55:26,143 INFO L226 Difference]: Without dead ends: 115 [2023-11-23 08:55:26,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:55:26,144 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 97 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:26,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 398 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:55:26,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-23 08:55:26,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2023-11-23 08:55:26,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 78 states have internal predecessors, (102), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-23 08:55:26,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 148 transitions. [2023-11-23 08:55:26,159 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 148 transitions. Word has length 65 [2023-11-23 08:55:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:26,160 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 148 transitions. [2023-11-23 08:55:26,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.0) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-11-23 08:55:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 148 transitions. [2023-11-23 08:55:26,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:55:26,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:26,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:26,176 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 08:55:26,369 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 08:55:26,370 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:26,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:26,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1948755529, now seen corresponding path program 1 times [2023-11-23 08:55:26,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742943256] [2023-11-23 08:55:26,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:26,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:26,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:26,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:26,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:26,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:26,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:26,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:55:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:26,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:55:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:26,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:55:26,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:55:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:55:26,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:26,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742943256] [2023-11-23 08:55:26,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742943256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:26,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992503788] [2023-11-23 08:55:26,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:26,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:26,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:26,780 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 08:55:26,823 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 08:55:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:26,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-23 08:55:26,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:27,003 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 20 treesize of output 9 [2023-11-23 08:55:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:55:27,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:55:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1992503788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:55:27,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:55:27,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9] total 17 [2023-11-23 08:55:27,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182438007] [2023-11-23 08:55:27,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:27,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:55:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:55:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:55:27,504 INFO L87 Difference]: Start difference. First operand 110 states and 148 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:55:29,512 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 08:55:31,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:33,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:35,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:37,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:39,698 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 08:55:41,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:41,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:41,287 INFO L93 Difference]: Finished difference Result 188 states and 253 transitions. [2023-11-23 08:55:41,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:55:41,287 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2023-11-23 08:55:41,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:41,289 INFO L225 Difference]: With dead ends: 188 [2023-11-23 08:55:41,289 INFO L226 Difference]: Without dead ends: 136 [2023-11-23 08:55:41,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:55:41,290 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 142 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 21 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.7s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:41,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 361 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 247 Invalid, 6 Unknown, 0 Unchecked, 13.7s Time] [2023-11-23 08:55:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-23 08:55:41,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2023-11-23 08:55:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 96 states have internal predecessors, (127), 25 states have call successors, (25), 9 states have call predecessors, (25), 10 states have return successors, (25), 23 states have call predecessors, (25), 23 states have call successors, (25) [2023-11-23 08:55:41,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 177 transitions. [2023-11-23 08:55:41,306 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 177 transitions. Word has length 65 [2023-11-23 08:55:41,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:41,306 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 177 transitions. [2023-11-23 08:55:41,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-23 08:55:41,307 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 177 transitions. [2023-11-23 08:55:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-23 08:55:41,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:41,308 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:41,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-23 08:55:41,523 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 08:55:41,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:41,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1467675271, now seen corresponding path program 1 times [2023-11-23 08:55:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:41,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750789722] [2023-11-23 08:55:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:41,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:41,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:41,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:41,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:41,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:55:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:55:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:41,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:55:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:41,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:55:41,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:55:41,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750789722] [2023-11-23 08:55:41,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750789722] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723263011] [2023-11-23 08:55:41,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:41,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:41,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:41,677 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 08:55:41,678 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 08:55:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:41,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:55:41,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:41,849 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:55:41,849 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:55:41,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723263011] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:55:41,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:55:41,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-23 08:55:41,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631985925] [2023-11-23 08:55:41,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:41,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:55:41,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:41,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:55:41,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:55:41,852 INFO L87 Difference]: Start difference. First operand 129 states and 177 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:55:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:41,912 INFO L93 Difference]: Finished difference Result 275 states and 386 transitions. [2023-11-23 08:55:41,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:55:41,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 65 [2023-11-23 08:55:41,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:41,914 INFO L225 Difference]: With dead ends: 275 [2023-11-23 08:55:41,914 INFO L226 Difference]: Without dead ends: 159 [2023-11-23 08:55:41,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:55:41,915 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 33 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:41,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 226 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:55:41,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-11-23 08:55:41,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 142. [2023-11-23 08:55:41,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 104 states have (on average 1.375) internal successors, (143), 108 states have internal predecessors, (143), 26 states have call successors, (26), 9 states have call predecessors, (26), 11 states have return successors, (28), 24 states have call predecessors, (28), 24 states have call successors, (28) [2023-11-23 08:55:41,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 197 transitions. [2023-11-23 08:55:41,936 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 197 transitions. Word has length 65 [2023-11-23 08:55:41,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:41,936 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 197 transitions. [2023-11-23 08:55:41,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:55:41,936 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 197 transitions. [2023-11-23 08:55:41,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2023-11-23 08:55:41,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:41,939 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:41,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-23 08:55:42,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:42,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:42,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:42,140 INFO L85 PathProgramCache]: Analyzing trace with hash 177708292, now seen corresponding path program 1 times [2023-11-23 08:55:42,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:42,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675404228] [2023-11-23 08:55:42,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:42,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:42,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:42,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:55:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-23 08:55:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:42,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-23 08:55:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:42,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:55:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:42,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 08:55:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 08:55:42,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:42,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675404228] [2023-11-23 08:55:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675404228] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:42,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578521530] [2023-11-23 08:55:42,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:42,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:42,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:42,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:55:42,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 08:55:42,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:42,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-23 08:55:42,478 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:42,515 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 08:55:42,522 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 08:55:42,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,564 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 08:55:42,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,570 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 08:55:42,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,579 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 08:55:42,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,584 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 34 treesize of output 25 [2023-11-23 08:55:42,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,687 INFO L349 Elim1Store]: treesize reduction 219, result has 10.6 percent of original size [2023-11-23 08:55:42,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 150 treesize of output 74 [2023-11-23 08:55:42,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,702 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 47 treesize of output 42 [2023-11-23 08:55:42,706 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 08:55:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:55:43,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:55:43,979 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_rend_harness_~#list~0#1.offset|))) (and (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_554 Int)) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_554)))) (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 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (forall ((|ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| Int) (v_ArrVal_555 (Array Int Int))) (= (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_555))) (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 |ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) is different from false [2023-11-23 08:55:43,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:43,994 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 08:55:44,013 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_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)) (forall ((v_arrayElimArr_5 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_arrayElimArr_5))) (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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| Int)) (or (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_15| Int) (v_subst_1 Int) (v_ArrVal_555 (Array Int Int))) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_15|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| v_ArrVal_555))) (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_subst_1))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_25| 1)))))) is different from false [2023-11-23 08:55:44,024 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:44,024 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:44,081 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:55:44,082 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 297 treesize of output 284 [2023-11-23 08:55:44,115 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:44,116 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:44,206 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2023-11-23 08:55:44,206 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 237 treesize of output 266 [2023-11-23 08:55:44,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:44,228 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 296 treesize of output 294 [2023-11-23 08:55:44,239 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 253 treesize of output 241 [2023-11-23 08:55:44,258 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:44,259 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 358 treesize of output 330 [2023-11-23 08:55:44,275 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 289 treesize of output 277 [2023-11-23 08:55:44,300 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 08:55:44,357 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 08:55:44,872 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:44,873 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:44,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:44,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 97 [2023-11-23 08:55:44,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:45,000 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 90 treesize of output 92 [2023-11-23 08:55:45,060 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2023-11-23 08:55:45,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578521530] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:55:45,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:55:45,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2023-11-23 08:55:45,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970018352] [2023-11-23 08:55:45,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:55:45,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 08:55:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:45,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 08:55:45,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=364, Unknown=2, NotChecked=78, Total=506 [2023-11-23 08:55:45,065 INFO L87 Difference]: Start difference. First operand 142 states and 197 transitions. Second operand has 23 states, 20 states have (on average 4.5) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-23 08:55:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:47,244 INFO L93 Difference]: Finished difference Result 297 states and 430 transitions. [2023-11-23 08:55:47,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-23 08:55:47,244 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 4.5) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) Word has length 66 [2023-11-23 08:55:47,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:47,246 INFO L225 Difference]: With dead ends: 297 [2023-11-23 08:55:47,246 INFO L226 Difference]: Without dead ends: 228 [2023-11-23 08:55:47,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 124 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=154, Invalid=1042, Unknown=2, NotChecked=134, Total=1332 [2023-11-23 08:55:47,248 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 77 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:47,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1375 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1230 Invalid, 0 Unknown, 335 Unchecked, 1.6s Time] [2023-11-23 08:55:47,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-11-23 08:55:47,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 212. [2023-11-23 08:55:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 163 states have internal predecessors, (215), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 08:55:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 300 transitions. [2023-11-23 08:55:47,269 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 300 transitions. Word has length 66 [2023-11-23 08:55:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:47,270 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 300 transitions. [2023-11-23 08:55:47,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 4.5) internal successors, (90), 22 states have internal predecessors, (90), 9 states have call successors, (20), 3 states have call predecessors, (20), 7 states have return successors, (19), 7 states have call predecessors, (19), 9 states have call successors, (19) [2023-11-23 08:55:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 300 transitions. [2023-11-23 08:55:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-11-23 08:55:47,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:47,271 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:47,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 08:55:47,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:47,485 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:47,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:47,485 INFO L85 PathProgramCache]: Analyzing trace with hash -753208181, now seen corresponding path program 1 times [2023-11-23 08:55:47,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:47,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843410580] [2023-11-23 08:55:47,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:47,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:47,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:47,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:55:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:47,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:55:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:47,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:55:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:47,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:55:47,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:47,642 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:55:47,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:47,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843410580] [2023-11-23 08:55:47,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843410580] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:47,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810639096] [2023-11-23 08:55:47,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:47,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:47,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:47,644 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:55:47,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 08:55:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:47,769 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 08:55:47,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:47,810 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:55:47,810 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:55:47,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810639096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:55:47,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:55:47,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2023-11-23 08:55:47,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703522751] [2023-11-23 08:55:47,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:47,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:55:47,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:47,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:55:47,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:55:47,813 INFO L87 Difference]: Start difference. First operand 212 states and 300 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:55:47,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:47,912 INFO L93 Difference]: Finished difference Result 426 states and 607 transitions. [2023-11-23 08:55:47,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:55:47,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2023-11-23 08:55:47,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:47,914 INFO L225 Difference]: With dead ends: 426 [2023-11-23 08:55:47,914 INFO L226 Difference]: Without dead ends: 230 [2023-11-23 08:55:47,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:55:47,917 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 32 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:47,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 232 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:55:47,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-11-23 08:55:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 212. [2023-11-23 08:55:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 163 states have internal predecessors, (215), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 08:55:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 300 transitions. [2023-11-23 08:55:47,949 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 300 transitions. Word has length 67 [2023-11-23 08:55:47,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:47,949 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 300 transitions. [2023-11-23 08:55:47,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:55:47,950 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 300 transitions. [2023-11-23 08:55:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-23 08:55:47,950 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:47,951 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:47,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 08:55:48,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-11-23 08:55:48,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:48,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:48,166 INFO L85 PathProgramCache]: Analyzing trace with hash 627512568, now seen corresponding path program 1 times [2023-11-23 08:55:48,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:48,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117165844] [2023-11-23 08:55:48,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:48,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:48,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:48,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:55:48,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:55:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:55:48,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:55:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,291 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 08:55:48,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117165844] [2023-11-23 08:55:48,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117165844] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:48,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071888012] [2023-11-23 08:55:48,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:48,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:48,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:48,292 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:55:48,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 08:55:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:55:48,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:48,466 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:55:48,466 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:55:48,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071888012] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:55:48,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:55:48,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2023-11-23 08:55:48,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165255644] [2023-11-23 08:55:48,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:48,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:55:48,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:48,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:55:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:55:48,469 INFO L87 Difference]: Start difference. First operand 212 states and 300 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:55:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:48,607 INFO L93 Difference]: Finished difference Result 471 states and 676 transitions. [2023-11-23 08:55:48,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:55:48,608 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 69 [2023-11-23 08:55:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:48,610 INFO L225 Difference]: With dead ends: 471 [2023-11-23 08:55:48,610 INFO L226 Difference]: Without dead ends: 275 [2023-11-23 08:55:48,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:55:48,611 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 56 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:48,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 273 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:55:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-11-23 08:55:48,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 215. [2023-11-23 08:55:48,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 158 states have (on average 1.3987341772151898) internal successors, (221), 166 states have internal predecessors, (221), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 08:55:48,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 306 transitions. [2023-11-23 08:55:48,655 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 306 transitions. Word has length 69 [2023-11-23 08:55:48,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:48,655 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 306 transitions. [2023-11-23 08:55:48,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:55:48,655 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 306 transitions. [2023-11-23 08:55:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:55:48,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:48,657 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:48,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 08:55:48,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 08:55:48,870 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:48,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:48,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1859726958, now seen corresponding path program 1 times [2023-11-23 08:55:48,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:48,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383288337] [2023-11-23 08:55:48,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:48,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:48,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:48,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:48,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:55:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:49,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:55:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:49,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-23 08:55:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:49,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-23 08:55:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:49,022 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2023-11-23 08:55:49,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:49,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383288337] [2023-11-23 08:55:49,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383288337] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:49,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448881630] [2023-11-23 08:55:49,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:49,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:49,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:49,041 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:55:49,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 08:55:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:49,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-23 08:55:49,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:49,266 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:55:49,266 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:55:49,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448881630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:55:49,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:55:49,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-23 08:55:49,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530607478] [2023-11-23 08:55:49,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:49,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 08:55:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:49,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 08:55:49,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:55:49,269 INFO L87 Difference]: Start difference. First operand 215 states and 306 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:55:49,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:55:49,313 INFO L93 Difference]: Finished difference Result 444 states and 658 transitions. [2023-11-23 08:55:49,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 08:55:49,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2023-11-23 08:55:49,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:55:49,316 INFO L225 Difference]: With dead ends: 444 [2023-11-23 08:55:49,316 INFO L226 Difference]: Without dead ends: 245 [2023-11-23 08:55:49,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:55:49,318 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:55:49,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 128 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:55:49,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-11-23 08:55:49,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 224. [2023-11-23 08:55:49,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 167 states have (on average 1.3952095808383234) internal successors, (233), 175 states have internal predecessors, (233), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 08:55:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 318 transitions. [2023-11-23 08:55:49,341 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 318 transitions. Word has length 70 [2023-11-23 08:55:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:55:49,342 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 318 transitions. [2023-11-23 08:55:49,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-23 08:55:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 318 transitions. [2023-11-23 08:55:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 08:55:49,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:55:49,343 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:55:49,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 08:55:49,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 08:55:49,559 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:55:49,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:55:49,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1729830676, now seen corresponding path program 1 times [2023-11-23 08:55:49,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:55:49,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568718191] [2023-11-23 08:55:49,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:49,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:55:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:49,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:55:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:55:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:49,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:55:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:55:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:50,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:55:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:50,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:55:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:50,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:55:50,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:50,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:55:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:55:50,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:55:50,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568718191] [2023-11-23 08:55:50,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568718191] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:50,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16045107] [2023-11-23 08:55:50,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:55:50,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:55:50,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:55:50,192 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:55:50,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 08:55:50,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:55:50,333 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-23 08:55:50,335 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:55:50,408 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 20 treesize of output 9 [2023-11-23 08:55:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:55:51,669 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:55:51,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16045107] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:55:51,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:55:51,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [15] total 24 [2023-11-23 08:55:51,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742064077] [2023-11-23 08:55:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:51,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:55:51,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:55:51,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:55:51,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2023-11-23 08:55:51,671 INFO L87 Difference]: Start difference. First operand 224 states and 318 transitions. Second operand has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-23 08:55:53,677 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 08:55:55,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:57,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:55:59,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:56:01,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:56:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:56:02,307 INFO L93 Difference]: Finished difference Result 314 states and 439 transitions. [2023-11-23 08:56:02,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 08:56:02,307 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 77 [2023-11-23 08:56:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:56:02,309 INFO L225 Difference]: With dead ends: 314 [2023-11-23 08:56:02,309 INFO L226 Difference]: Without dead ends: 226 [2023-11-23 08:56:02,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=90, Invalid=666, Unknown=0, NotChecked=0, Total=756 [2023-11-23 08:56:02,310 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 94 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 21 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:56:02,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 366 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 275 Invalid, 5 Unknown, 0 Unchecked, 10.5s Time] [2023-11-23 08:56:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-23 08:56:02,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2023-11-23 08:56:02,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 167 states have (on average 1.3892215568862276) internal successors, (232), 175 states have internal predecessors, (232), 38 states have call successors, (38), 13 states have call predecessors, (38), 18 states have return successors, (47), 35 states have call predecessors, (47), 35 states have call successors, (47) [2023-11-23 08:56:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 317 transitions. [2023-11-23 08:56:02,336 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 317 transitions. Word has length 77 [2023-11-23 08:56:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:56:02,336 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 317 transitions. [2023-11-23 08:56:02,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.0) internal successors, (60), 11 states have internal predecessors, (60), 5 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2023-11-23 08:56:02,337 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2023-11-23 08:56:02,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-23 08:56:02,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:56:02,338 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:56:02,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 08:56:02,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 08:56:02,545 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:56:02,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:56:02,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1828778984, now seen corresponding path program 1 times [2023-11-23 08:56:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:56:02,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271822833] [2023-11-23 08:56:02,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:56:02,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:56:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:02,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:56:02,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:02,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:56:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:02,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:56:02,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:02,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:56:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:02,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:56:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:02,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:56:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:02,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:56:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:56:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:56:02,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:56:02,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271822833] [2023-11-23 08:56:02,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271822833] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:56:02,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803294586] [2023-11-23 08:56:02,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:56:02,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:56:02,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:56:02,914 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:56:02,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 08:56:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:56:03,124 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:56:03,181 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 08:56:03,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:56:03,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803294586] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:56:03,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:56:03,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-11-23 08:56:03,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614516663] [2023-11-23 08:56:03,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:56:03,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:56:03,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:56:03,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:56:03,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:56:03,185 INFO L87 Difference]: Start difference. First operand 224 states and 317 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:56:03,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:56:03,248 INFO L93 Difference]: Finished difference Result 435 states and 606 transitions. [2023-11-23 08:56:03,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:56:03,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 77 [2023-11-23 08:56:03,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:56:03,250 INFO L225 Difference]: With dead ends: 435 [2023-11-23 08:56:03,250 INFO L226 Difference]: Without dead ends: 176 [2023-11-23 08:56:03,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 08:56:03,252 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 35 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:56:03,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 293 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:56:03,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2023-11-23 08:56:03,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2023-11-23 08:56:03,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 122 states have (on average 1.2868852459016393) internal successors, (157), 130 states have internal predecessors, (157), 35 states have call successors, (35), 13 states have call predecessors, (35), 18 states have return successors, (44), 32 states have call predecessors, (44), 32 states have call successors, (44) [2023-11-23 08:56:03,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 236 transitions. [2023-11-23 08:56:03,270 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 236 transitions. Word has length 77 [2023-11-23 08:56:03,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:56:03,271 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 236 transitions. [2023-11-23 08:56:03,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:56:03,271 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 236 transitions. [2023-11-23 08:56:03,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-11-23 08:56:03,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:56:03,273 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:56:03,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 08:56:03,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 08:56:03,480 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:56:03,481 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:56:03,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1004260387, now seen corresponding path program 1 times [2023-11-23 08:56:03,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:56:03,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907222512] [2023-11-23 08:56:03,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:56:03,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:56:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:56:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:56:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:56:03,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:56:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:56:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-23 08:56:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:56:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:56:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,673 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-23 08:56:03,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:56:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907222512] [2023-11-23 08:56:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907222512] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:56:03,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845002651] [2023-11-23 08:56:03,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:56:03,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:56:03,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:56:03,675 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:56:03,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 08:56:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,844 INFO L262 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 63 conjunts are in the unsatisfiable core [2023-11-23 08:56:03,846 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:56:03,887 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:56:03,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:03,890 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 08:56:03,930 INFO L349 Elim1Store]: treesize reduction 68, result has 9.3 percent of original size [2023-11-23 08:56:03,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 29 [2023-11-23 08:56:05,957 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_50| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_50|))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)) .cse1) (not (= .cse1 0)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_50|))))) is different from true [2023-11-23 08:56:07,969 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_50| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_50|))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_37| 24)) .cse1) (not (= .cse1 0)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_50|))))) is different from true [2023-11-23 08:56:10,124 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_51| Int) (|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_51|))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset_BEFORE_CALL_38| 24)) .cse1) (not (= .cse1 0)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_51|))))) is different from true [2023-11-23 08:56:12,201 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_12| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_13| Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_13|))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_12|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_12| 24)) .cse1) (not (= .cse1 0)) (<= (+ 2 .cse1) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_13|))))) is different from true [2023-11-23 08:56:14,341 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_13| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_14| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_14|))) (let ((.cse0 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_13|))) (and (not (= .cse0 0)) (<= (+ 2 .cse0) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_14|) (= (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_13| 24)) .cse0))))) is different from true [2023-11-23 08:56:16,414 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_14| Int) (|v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_15| Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_15|))) (let ((.cse0 (select .cse1 |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_14|))) (and (<= (+ .cse0 2) |v_ULTIMATE.start_aws_linked_list_rend_~list#1.base_BEFORE_CALL_15|) (= .cse0 (select .cse1 (+ |v_ULTIMATE.start_aws_linked_list_rend_~list#1.offset_BEFORE_CALL_14| 24))) (not (= .cse0 0)))))) is different from true [2023-11-23 08:56:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 36 not checked. [2023-11-23 08:56:16,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:56:16,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:56:16,870 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2023-11-23 08:56:16,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:56:16,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 231 treesize of output 223 [2023-11-23 08:56:16,890 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 448 treesize of output 424 [2023-11-23 08:56:16,967 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 24 treesize of output 20 [2023-11-23 08:56:16,972 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 08:56:16,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:56:16,988 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 77 treesize of output 69 [2023-11-23 08:56:17,141 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-11-23 08:56:17,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845002651] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:56:17,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:56:17,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 17, 11] total 31 [2023-11-23 08:56:17,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802862401] [2023-11-23 08:56:17,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:56:17,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 08:56:17,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:56:17,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 08:56:17,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=537, Unknown=6, NotChecked=306, Total=930 [2023-11-23 08:56:17,143 INFO L87 Difference]: Start difference. First operand 176 states and 236 transitions. Second operand has 31 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 28 states have internal predecessors, (115), 10 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2023-11-23 08:56:19,405 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 08:56:21,524 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 08:56:23,562 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 08:56:25,659 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 08:56:38,337 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 08:56:40,342 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 08:56:42,348 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 08:56:55,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:56:55,625 INFO L93 Difference]: Finished difference Result 519 states and 704 transitions. [2023-11-23 08:56:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-11-23 08:56:55,626 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 28 states have internal predecessors, (115), 10 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 78 [2023-11-23 08:56:55,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:56:55,628 INFO L225 Difference]: With dead ends: 519 [2023-11-23 08:56:55,628 INFO L226 Difference]: Without dead ends: 251 [2023-11-23 08:56:55,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 151 SyntacticMatches, 6 SemanticMatches, 63 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=447, Invalid=2987, Unknown=12, NotChecked=714, Total=4160 [2023-11-23 08:56:55,630 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 110 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 58 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 3419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 1928 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:56:55,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1582 Invalid, 3419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1426 Invalid, 7 Unknown, 1928 Unchecked, 15.3s Time] [2023-11-23 08:56:55,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-11-23 08:56:55,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 224. [2023-11-23 08:56:55,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 166 states have (on average 1.2771084337349397) internal successors, (212), 173 states have internal predecessors, (212), 37 states have call successors, (37), 16 states have call predecessors, (37), 20 states have return successors, (46), 34 states have call predecessors, (46), 34 states have call successors, (46) [2023-11-23 08:56:55,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 295 transitions. [2023-11-23 08:56:55,646 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 295 transitions. Word has length 78 [2023-11-23 08:56:55,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:56:55,647 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 295 transitions. [2023-11-23 08:56:55,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.8333333333333335) internal successors, (115), 28 states have internal predecessors, (115), 10 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2023-11-23 08:56:55,647 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 295 transitions. [2023-11-23 08:56:55,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:56:55,650 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:56:55,650 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:56:55,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 08:56:55,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 08:56:55,852 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:56:55,852 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:56:55,853 INFO L85 PathProgramCache]: Analyzing trace with hash -851846458, now seen corresponding path program 1 times [2023-11-23 08:56:55,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:56:55,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237313409] [2023-11-23 08:56:55,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:56:55,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:56:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:56,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:56:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:56,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:56:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:56,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:56:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:56,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:56:56,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:56:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:56,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:56:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:56:56,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:56,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:56:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:56,226 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-11-23 08:56:56,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:56:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237313409] [2023-11-23 08:56:56,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237313409] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:56:56,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874151153] [2023-11-23 08:56:56,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:56:56,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:56:56,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:56:56,245 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:56:56,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 08:56:56,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:56,435 INFO L262 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-23 08:56:56,438 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:56:56,468 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 08:56:56,477 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 08:56:56,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,528 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 08:56:56,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,532 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 08:56:56,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,564 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 08:56:56,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,569 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 34 treesize of output 25 [2023-11-23 08:56:56,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,682 INFO L349 Elim1Store]: treesize reduction 219, result has 10.6 percent of original size [2023-11-23 08:56:56,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 150 treesize of output 74 [2023-11-23 08:56:56,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:56,691 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 47 treesize of output 42 [2023-11-23 08:56:56,693 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 08:56:57,892 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 08:56:57,892 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:56:58,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:56:58,274 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-23 08:56:58,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 8 |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (forall ((v_arrayElimArr_12 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_arrayElimArr_12))) (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_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34|))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)))) (forall ((|v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| 1)) (forall ((v_ArrVal_1092 (Array Int Int)) (|v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_19| Int) (v_subst_4 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| |v_ULTIMATE.start_ensure_linked_list_is_allocated_~node~0#1.offset_19|)) |v_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base_34| v_ArrVal_1092))) (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_subst_4))) |c_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base|) .cse2) 0)))))) is different from false [2023-11-23 08:56:58,308 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:58,309 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:58,373 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2023-11-23 08:56:58,373 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 171 treesize of output 200 [2023-11-23 08:56:58,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:58,383 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:58,452 INFO L349 Elim1Store]: treesize reduction 88, result has 44.7 percent of original size [2023-11-23 08:56:58,452 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 355 treesize of output 342 [2023-11-23 08:56:58,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:56:58,470 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 286 [2023-11-23 08:56:58,480 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 245 treesize of output 233 [2023-11-23 08:56:58,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:56:58,497 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 350 treesize of output 326 [2023-11-23 08:56:58,509 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 285 treesize of output 273 [2023-11-23 08:56:59,089 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 08:56:59,098 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 08:56:59,120 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:59,121 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:59,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:56:59,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 88 [2023-11-23 08:56:59,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:56:59,208 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 46 treesize of output 52 [2023-11-23 08:56:59,266 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 1 not checked. [2023-11-23 08:56:59,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874151153] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:56:59,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:56:59,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 11] total 27 [2023-11-23 08:56:59,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434993151] [2023-11-23 08:56:59,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:56:59,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-23 08:56:59,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:56:59,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-23 08:56:59,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=568, Unknown=9, NotChecked=48, Total=702 [2023-11-23 08:56:59,268 INFO L87 Difference]: Start difference. First operand 224 states and 295 transitions. Second operand has 27 states, 25 states have (on average 5.08) internal successors, (127), 27 states have internal predecessors, (127), 10 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 8 states have call predecessors, (22), 10 states have call successors, (22) [2023-11-23 08:57:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:02,248 INFO L93 Difference]: Finished difference Result 570 states and 794 transitions. [2023-11-23 08:57:02,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-23 08:57:02,249 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 5.08) internal successors, (127), 27 states have internal predecessors, (127), 10 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 8 states have call predecessors, (22), 10 states have call successors, (22) Word has length 80 [2023-11-23 08:57:02,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:02,251 INFO L225 Difference]: With dead ends: 570 [2023-11-23 08:57:02,251 INFO L226 Difference]: Without dead ends: 311 [2023-11-23 08:57:02,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 170 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=541, Invalid=2642, Unknown=13, NotChecked=110, Total=3306 [2023-11-23 08:57:02,253 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 390 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:02,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 791 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1274 Invalid, 0 Unknown, 260 Unchecked, 1.5s Time] [2023-11-23 08:57:02,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-11-23 08:57:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 258. [2023-11-23 08:57:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.25) internal successors, (245), 203 states have internal predecessors, (245), 41 states have call successors, (41), 16 states have call predecessors, (41), 20 states have return successors, (50), 38 states have call predecessors, (50), 38 states have call successors, (50) [2023-11-23 08:57:02,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 336 transitions. [2023-11-23 08:57:02,278 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 336 transitions. Word has length 80 [2023-11-23 08:57:02,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:02,279 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 336 transitions. [2023-11-23 08:57:02,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 5.08) internal successors, (127), 27 states have internal predecessors, (127), 10 states have call successors, (23), 3 states have call predecessors, (23), 5 states have return successors, (22), 8 states have call predecessors, (22), 10 states have call successors, (22) [2023-11-23 08:57:02,279 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 336 transitions. [2023-11-23 08:57:02,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:57:02,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:02,280 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:57:02,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:02,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:02,492 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:02,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash 108223488, now seen corresponding path program 1 times [2023-11-23 08:57:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:02,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260661658] [2023-11-23 08:57:02,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:02,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:57:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:57:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:57:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:57:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:57:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-23 08:57:02,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:02,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260661658] [2023-11-23 08:57:02,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260661658] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:02,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1020777462] [2023-11-23 08:57:02,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:02,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:02,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:02,597 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:57:02,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-23 08:57:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:02,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:57:02,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:02,754 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2023-11-23 08:57:02,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:02,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1020777462] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:02,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:57:02,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:57:02,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534966415] [2023-11-23 08:57:02,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:02,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:57:02,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:02,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:57:02,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:57:02,756 INFO L87 Difference]: Start difference. First operand 258 states and 336 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:57:02,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:02,806 INFO L93 Difference]: Finished difference Result 418 states and 560 transitions. [2023-11-23 08:57:02,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 08:57:02,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2023-11-23 08:57:02,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:02,808 INFO L225 Difference]: With dead ends: 418 [2023-11-23 08:57:02,808 INFO L226 Difference]: Without dead ends: 252 [2023-11-23 08:57:02,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:57:02,809 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 9 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:02,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 193 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:57:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-23 08:57:02,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2023-11-23 08:57:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 190 states have (on average 1.2421052631578948) internal successors, (236), 197 states have internal predecessors, (236), 41 states have call successors, (41), 16 states have call predecessors, (41), 20 states have return successors, (50), 38 states have call predecessors, (50), 38 states have call successors, (50) [2023-11-23 08:57:02,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 327 transitions. [2023-11-23 08:57:02,833 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 327 transitions. Word has length 80 [2023-11-23 08:57:02,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:02,834 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 327 transitions. [2023-11-23 08:57:02,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:57:02,834 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 327 transitions. [2023-11-23 08:57:02,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:57:02,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:02,836 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:57:02,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:03,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-23 08:57:03,049 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:03,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:03,049 INFO L85 PathProgramCache]: Analyzing trace with hash 310047422, now seen corresponding path program 1 times [2023-11-23 08:57:03,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:03,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186977355] [2023-11-23 08:57:03,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:03,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:57:03,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:57:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:57:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-11-23 08:57:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-11-23 08:57:03,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,175 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2023-11-23 08:57:03,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:03,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186977355] [2023-11-23 08:57:03,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186977355] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:03,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1208141364] [2023-11-23 08:57:03,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:03,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:03,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:03,176 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:57:03,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-23 08:57:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:57:03,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:03,348 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-23 08:57:03,348 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:03,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1208141364] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:03,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:57:03,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2023-11-23 08:57:03,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680534221] [2023-11-23 08:57:03,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:03,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:57:03,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:03,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:57:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:57:03,349 INFO L87 Difference]: Start difference. First operand 252 states and 327 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:57:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:03,393 INFO L93 Difference]: Finished difference Result 401 states and 535 transitions. [2023-11-23 08:57:03,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 08:57:03,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 80 [2023-11-23 08:57:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:03,394 INFO L225 Difference]: With dead ends: 401 [2023-11-23 08:57:03,394 INFO L226 Difference]: Without dead ends: 241 [2023-11-23 08:57:03,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:57:03,395 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 3 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:03,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 193 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:57:03,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-11-23 08:57:03,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2023-11-23 08:57:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 179 states have (on average 1.2122905027932962) internal successors, (217), 186 states have internal predecessors, (217), 41 states have call successors, (41), 16 states have call predecessors, (41), 20 states have return successors, (50), 38 states have call predecessors, (50), 38 states have call successors, (50) [2023-11-23 08:57:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 308 transitions. [2023-11-23 08:57:03,417 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 308 transitions. Word has length 80 [2023-11-23 08:57:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:03,418 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 308 transitions. [2023-11-23 08:57:03,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-23 08:57:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 308 transitions. [2023-11-23 08:57:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-23 08:57:03,419 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:03,419 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:57:03,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:03,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-23 08:57:03,632 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:03,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:03,632 INFO L85 PathProgramCache]: Analyzing trace with hash -935936028, now seen corresponding path program 1 times [2023-11-23 08:57:03,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:03,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170692747] [2023-11-23 08:57:03,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:03,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:57:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:04,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:04,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-23 08:57:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:04,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:57:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:04,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:57:04,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:04,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-23 08:57:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:57:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170692747] [2023-11-23 08:57:04,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170692747] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:04,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746916161] [2023-11-23 08:57:04,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:04,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:04,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:04,107 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:57:04,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-23 08:57:04,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:04,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 81 conjunts are in the unsatisfiable core [2023-11-23 08:57:04,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:04,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:04,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 24 treesize of output 32 [2023-11-23 08:57:04,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:04,365 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 21 treesize of output 1 [2023-11-23 08:57:04,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-23 08:57:04,406 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_66| Int) (v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_66|))) (let ((.cse1 (select .cse0 24))) (and (= .cse0 (store (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_66| v_DerPreprocessor_3) .cse1 v_DerPreprocessor_4) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_66|) 24 .cse1)) (<= (+ .cse1 2) |v_ULTIMATE.start_aws_linked_list_rend_harness_~#list~0#1.base_BEFORE_CALL_66|))))) is different from true [2023-11-23 08:57:05,194 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:57:05,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:57:13,783 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:57:13,892 INFO L349 Elim1Store]: treesize reduction 153, result has 52.3 percent of original size [2023-11-23 08:57:13,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 1730 treesize of output 1374 [2023-11-23 08:57:14,031 INFO L349 Elim1Store]: treesize reduction 8, result has 91.0 percent of original size [2023-11-23 08:57:14,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1272 treesize of output 1278 [2023-11-23 08:57:14,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2862 treesize of output 2766 [2023-11-23 08:57:14,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:57:14,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1614 treesize of output 1596 [2023-11-23 08:57:14,251 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 1714 treesize of output 1688 [2023-11-23 08:57:14,297 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 1692 treesize of output 1646 [2023-11-23 08:57:14,779 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:57:18,698 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:57:19,144 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:57:19,144 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 21 treesize of output 15 [2023-11-23 08:57:19,168 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:57:19,169 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 14 treesize of output 8 [2023-11-23 08:57:19,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:57:19,194 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 185 treesize of output 195 [2023-11-23 08:57:19,496 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:57:19,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746916161] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:57:19,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:57:19,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 21] total 47 [2023-11-23 08:57:19,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91390907] [2023-11-23 08:57:19,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:57:19,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2023-11-23 08:57:19,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:19,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2023-11-23 08:57:19,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1871, Unknown=54, NotChecked=88, Total=2162 [2023-11-23 08:57:19,498 INFO L87 Difference]: Start difference. First operand 241 states and 308 transitions. Second operand has 47 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 12 states have call successors, (24), 4 states have call predecessors, (24), 9 states have return successors, (22), 9 states have call predecessors, (22), 12 states have call successors, (22) [2023-11-23 08:57:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:27,342 INFO L93 Difference]: Finished difference Result 571 states and 738 transitions. [2023-11-23 08:57:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-11-23 08:57:27,343 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 12 states have call successors, (24), 4 states have call predecessors, (24), 9 states have return successors, (22), 9 states have call predecessors, (22), 12 states have call successors, (22) Word has length 81 [2023-11-23 08:57:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:27,345 INFO L225 Difference]: With dead ends: 571 [2023-11-23 08:57:27,345 INFO L226 Difference]: Without dead ends: 387 [2023-11-23 08:57:27,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=935, Invalid=9614, Unknown=167, NotChecked=204, Total=10920 [2023-11-23 08:57:27,349 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 210 mSDsluCounter, 1449 mSDsCounter, 0 mSdLazyCounter, 3529 mSolverCounterSat, 114 mSolverCounterUnsat, 249 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 4235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3529 IncrementalHoareTripleChecker+Invalid, 249 IncrementalHoareTripleChecker+Unknown, 343 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:27,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 1527 Invalid, 4235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3529 Invalid, 249 Unknown, 343 Unchecked, 3.9s Time] [2023-11-23 08:57:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-11-23 08:57:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 313. [2023-11-23 08:57:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 236 states have (on average 1.2033898305084745) internal successors, (284), 244 states have internal predecessors, (284), 52 states have call successors, (52), 19 states have call predecessors, (52), 24 states have return successors, (69), 49 states have call predecessors, (69), 49 states have call successors, (69) [2023-11-23 08:57:27,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 405 transitions. [2023-11-23 08:57:27,402 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 405 transitions. Word has length 81 [2023-11-23 08:57:27,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:27,403 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 405 transitions. [2023-11-23 08:57:27,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 12 states have call successors, (24), 4 states have call predecessors, (24), 9 states have return successors, (22), 9 states have call predecessors, (22), 12 states have call successors, (22) [2023-11-23 08:57:27,403 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 405 transitions. [2023-11-23 08:57:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-11-23 08:57:27,404 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:27,404 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:57:27,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:27,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-23 08:57:27,622 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:27,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1762567985, now seen corresponding path program 1 times [2023-11-23 08:57:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:27,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357447930] [2023-11-23 08:57:27,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:27,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:27,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:27,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:27,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:27,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:57:27,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:27,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:27,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:57:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:27,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:57:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-23 08:57:28,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:57:28,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,038 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:57:28,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:28,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357447930] [2023-11-23 08:57:28,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357447930] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:28,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656555395] [2023-11-23 08:57:28,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:28,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:28,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:28,053 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:57:28,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-23 08:57:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:57:28,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-23 08:57:28,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:28,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656555395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:28,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:57:28,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 16 [2023-11-23 08:57:28,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132273582] [2023-11-23 08:57:28,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:28,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:57:28,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:28,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:57:28,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2023-11-23 08:57:28,353 INFO L87 Difference]: Start difference. First operand 313 states and 405 transitions. Second operand has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:57:28,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:28,562 INFO L93 Difference]: Finished difference Result 557 states and 715 transitions. [2023-11-23 08:57:28,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:57:28,563 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 84 [2023-11-23 08:57:28,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:28,564 INFO L225 Difference]: With dead ends: 557 [2023-11-23 08:57:28,564 INFO L226 Difference]: Without dead ends: 304 [2023-11-23 08:57:28,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:57:28,566 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 34 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:28,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 271 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:57:28,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-11-23 08:57:28,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2023-11-23 08:57:28,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 230 states have (on average 1.191304347826087) internal successors, (274), 235 states have internal predecessors, (274), 52 states have call successors, (52), 19 states have call predecessors, (52), 21 states have return successors, (63), 49 states have call predecessors, (63), 49 states have call successors, (63) [2023-11-23 08:57:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 389 transitions. [2023-11-23 08:57:28,600 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 389 transitions. Word has length 84 [2023-11-23 08:57:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:28,600 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 389 transitions. [2023-11-23 08:57:28,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.5) internal successors, (63), 7 states have internal predecessors, (63), 4 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-23 08:57:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 389 transitions. [2023-11-23 08:57:28,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-23 08:57:28,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:28,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:57:28,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:28,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:28,815 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:28,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:28,815 INFO L85 PathProgramCache]: Analyzing trace with hash -2018865053, now seen corresponding path program 2 times [2023-11-23 08:57:28,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:28,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491925463] [2023-11-23 08:57:28,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:28,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:57:28,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:57:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:57:28,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:57:28,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:57:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:57:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:28,993 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-23 08:57:28,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:28,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491925463] [2023-11-23 08:57:28,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491925463] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:28,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070712756] [2023-11-23 08:57:28,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 08:57:28,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:28,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:28,994 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:57:29,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-23 08:57:29,154 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-23 08:57:29,154 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 08:57:29,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:57:29,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:29,183 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-23 08:57:29,184 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:57:29,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070712756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:57:29,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:57:29,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2023-11-23 08:57:29,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790349502] [2023-11-23 08:57:29,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:57:29,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:57:29,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:29,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:57:29,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:57:29,185 INFO L87 Difference]: Start difference. First operand 304 states and 389 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 08:57:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:29,319 INFO L93 Difference]: Finished difference Result 324 states and 413 transitions. [2023-11-23 08:57:29,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:57:29,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 91 [2023-11-23 08:57:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:29,322 INFO L225 Difference]: With dead ends: 324 [2023-11-23 08:57:29,322 INFO L226 Difference]: Without dead ends: 322 [2023-11-23 08:57:29,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:57:29,323 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:29,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 322 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:57:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-23 08:57:29,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 318. [2023-11-23 08:57:29,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 238 states have (on average 1.184873949579832) internal successors, (282), 245 states have internal predecessors, (282), 54 states have call successors, (54), 21 states have call predecessors, (54), 25 states have return successors, (70), 51 states have call predecessors, (70), 51 states have call successors, (70) [2023-11-23 08:57:29,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 406 transitions. [2023-11-23 08:57:29,376 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 406 transitions. Word has length 91 [2023-11-23 08:57:29,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:29,376 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 406 transitions. [2023-11-23 08:57:29,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 08:57:29,376 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 406 transitions. [2023-11-23 08:57:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-23 08:57:29,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:29,377 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:57:29,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:29,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:29,589 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:29,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:29,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1392523396, now seen corresponding path program 1 times [2023-11-23 08:57:29,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:29,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962056951] [2023-11-23 08:57:29,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:29,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:29,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:29,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:57:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-23 08:57:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:57:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:57:29,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:57:29,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-11-23 08:57:29,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-23 08:57:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,765 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-11-23 08:57:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962056951] [2023-11-23 08:57:29,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962056951] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:29,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709628072] [2023-11-23 08:57:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:29,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:29,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:29,767 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:57:29,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-23 08:57:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:29,957 INFO L262 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-23 08:57:29,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:30,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 08:57:30,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:30,032 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 08:57:30,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:30,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-11-23 08:57:30,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:30,121 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-11-23 08:57:30,122 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 1 case distinctions, treesize of input 187 treesize of output 108 [2023-11-23 08:57:30,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:30,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:30,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 25 [2023-11-23 08:57:30,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:30,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:57:30,786 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-11-23 08:57:30,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 27 [2023-11-23 08:57:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 34 proven. 20 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-11-23 08:57:33,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:57:35,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:57:35,711 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 39 [2023-11-23 08:57:35,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:57:35,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 215 treesize of output 207 [2023-11-23 08:57:35,730 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 412 treesize of output 400 [2023-11-23 08:57:35,850 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 6 treesize of output 4 [2023-11-23 08:57:35,857 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 6 treesize of output 4 [2023-11-23 08:57:35,861 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 26 treesize of output 24 [2023-11-23 08:57:35,870 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 6 treesize of output 4 [2023-11-23 08:57:35,899 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:57:35,899 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 148 treesize of output 124 [2023-11-23 08:57:36,084 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2023-11-23 08:57:36,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709628072] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:57:36,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:57:36,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 18, 11] total 31 [2023-11-23 08:57:36,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356673223] [2023-11-23 08:57:36,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:57:36,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-23 08:57:36,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:57:36,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-23 08:57:36,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=829, Unknown=1, NotChecked=0, Total=930 [2023-11-23 08:57:36,086 INFO L87 Difference]: Start difference. First operand 318 states and 406 transitions. Second operand has 31 states, 27 states have (on average 4.814814814814815) internal successors, (130), 29 states have internal predecessors, (130), 12 states have call successors, (26), 4 states have call predecessors, (26), 8 states have return successors, (25), 8 states have call predecessors, (25), 12 states have call successors, (25) [2023-11-23 08:57:38,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:57:40,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:57:42,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:57:44,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 08:57:46,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-23 08:57:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:57:49,298 INFO L93 Difference]: Finished difference Result 484 states and 607 transitions. [2023-11-23 08:57:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-11-23 08:57:49,299 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 27 states have (on average 4.814814814814815) internal successors, (130), 29 states have internal predecessors, (130), 12 states have call successors, (26), 4 states have call predecessors, (26), 8 states have return successors, (25), 8 states have call predecessors, (25), 12 states have call successors, (25) Word has length 97 [2023-11-23 08:57:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:57:49,300 INFO L225 Difference]: With dead ends: 484 [2023-11-23 08:57:49,300 INFO L226 Difference]: Without dead ends: 304 [2023-11-23 08:57:49,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=286, Invalid=2469, Unknown=1, NotChecked=0, Total=2756 [2023-11-23 08:57:49,302 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 108 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 61 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1431 SdHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:57:49,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1431 Invalid, 1688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1622 Invalid, 5 Unknown, 0 Unchecked, 12.2s Time] [2023-11-23 08:57:49,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-11-23 08:57:49,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 300. [2023-11-23 08:57:49,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 222 states have (on average 1.1846846846846846) internal successors, (263), 228 states have internal predecessors, (263), 53 states have call successors, (53), 21 states have call predecessors, (53), 24 states have return successors, (66), 50 states have call predecessors, (66), 50 states have call successors, (66) [2023-11-23 08:57:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 382 transitions. [2023-11-23 08:57:49,341 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 382 transitions. Word has length 97 [2023-11-23 08:57:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:57:49,341 INFO L495 AbstractCegarLoop]: Abstraction has 300 states and 382 transitions. [2023-11-23 08:57:49,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 27 states have (on average 4.814814814814815) internal successors, (130), 29 states have internal predecessors, (130), 12 states have call successors, (26), 4 states have call predecessors, (26), 8 states have return successors, (25), 8 states have call predecessors, (25), 12 states have call successors, (25) [2023-11-23 08:57:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 382 transitions. [2023-11-23 08:57:49,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-23 08:57:49,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:57:49,343 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:57:49,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-23 08:57:49,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-23 08:57:49,557 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:57:49,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:57:49,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1783701773, now seen corresponding path program 1 times [2023-11-23 08:57:49,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:57:49,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866894021] [2023-11-23 08:57:49,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:49,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:57:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:57:49,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:57:49,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:57:49,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:57:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:57:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:49,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-11-23 08:57:49,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-23 08:57:49,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:57:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:49,807 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-23 08:57:49,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:57:49,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866894021] [2023-11-23 08:57:49,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866894021] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:57:49,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935131963] [2023-11-23 08:57:49,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:57:49,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:57:49,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:57:49,825 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:57:49,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-23 08:57:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:57:50,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 143 conjunts are in the unsatisfiable core [2023-11-23 08:57:50,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:57:50,187 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 14 treesize of output 15 [2023-11-23 08:57:50,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 08:57:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 31 proven. 36 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 08:57:52,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:57:58,644 INFO L349 Elim1Store]: treesize reduction 417, result has 44.5 percent of original size [2023-11-23 08:57:58,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 11 case distinctions, treesize of input 2696 treesize of output 2291 [2023-11-23 08:57:59,184 INFO L349 Elim1Store]: treesize reduction 423, result has 42.8 percent of original size [2023-11-23 08:57:59,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 4102 treesize of output 3977 [2023-11-23 08:57:59,490 INFO L349 Elim1Store]: treesize reduction 26, result has 80.2 percent of original size [2023-11-23 08:57:59,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 2165 treesize of output 2094 [2023-11-23 08:57:59,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:57:59,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1676 treesize of output 1644 [2023-11-23 08:58:12,908 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 6 treesize of output 4 [2023-11-23 08:58:41,437 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 6 treesize of output 4 [2023-11-23 08:58:47,279 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 6 treesize of output 4 [2023-11-23 08:58:47,323 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-23 08:58:47,323 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 23 treesize of output 22 [2023-11-23 08:58:47,349 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 6 treesize of output 4 [2023-11-23 08:58:47,676 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 14 treesize of output 12 [2023-11-23 08:58:47,688 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 24 treesize of output 22 [2023-11-23 08:58:47,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:58:47,703 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 17 treesize of output 21 [2023-11-23 08:58:47,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:58:47,725 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 38 treesize of output 42 [2023-11-23 08:58:47,848 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 29 proven. 41 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-11-23 08:58:47,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935131963] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:58:47,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:58:47,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 25, 28] total 56 [2023-11-23 08:58:47,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144413659] [2023-11-23 08:58:47,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:58:47,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-23 08:58:47,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:58:47,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-23 08:58:47,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2871, Unknown=2, NotChecked=0, Total=3080 [2023-11-23 08:58:47,851 INFO L87 Difference]: Start difference. First operand 300 states and 382 transitions. Second operand has 56 states, 49 states have (on average 3.204081632653061) internal successors, (157), 47 states have internal predecessors, (157), 16 states have call successors, (29), 4 states have call predecessors, (29), 13 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) [2023-11-23 08:58:54,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:58:54,177 INFO L93 Difference]: Finished difference Result 647 states and 867 transitions. [2023-11-23 08:58:54,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2023-11-23 08:58:54,178 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 49 states have (on average 3.204081632653061) internal successors, (157), 47 states have internal predecessors, (157), 16 states have call successors, (29), 4 states have call predecessors, (29), 13 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) Word has length 104 [2023-11-23 08:58:54,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:58:54,180 INFO L225 Difference]: With dead ends: 647 [2023-11-23 08:58:54,180 INFO L226 Difference]: Without dead ends: 423 [2023-11-23 08:58:54,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 179 SyntacticMatches, 7 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2860 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=1096, Invalid=10458, Unknown=2, NotChecked=0, Total=11556 [2023-11-23 08:58:54,184 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 374 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 2410 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 2569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 2410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:58:54,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1478 Invalid, 2569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 2410 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-23 08:58:54,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2023-11-23 08:58:54,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 313. [2023-11-23 08:58:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 231 states have (on average 1.1774891774891776) internal successors, (272), 239 states have internal predecessors, (272), 53 states have call successors, (53), 21 states have call predecessors, (53), 28 states have return successors, (74), 52 states have call predecessors, (74), 50 states have call successors, (74) [2023-11-23 08:58:54,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 399 transitions. [2023-11-23 08:58:54,230 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 399 transitions. Word has length 104 [2023-11-23 08:58:54,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:58:54,230 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 399 transitions. [2023-11-23 08:58:54,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 49 states have (on average 3.204081632653061) internal successors, (157), 47 states have internal predecessors, (157), 16 states have call successors, (29), 4 states have call predecessors, (29), 13 states have return successors, (27), 16 states have call predecessors, (27), 16 states have call successors, (27) [2023-11-23 08:58:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 399 transitions. [2023-11-23 08:58:54,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-23 08:58:54,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:58:54,232 INFO L195 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-23 08:58:54,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-23 08:58:54,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-23 08:58:54,446 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:58:54,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:58:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1640410158, now seen corresponding path program 1 times [2023-11-23 08:58:54,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:58:54,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314275872] [2023-11-23 08:58:54,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:58:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:58:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:54,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:58:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:54,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:58:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:54,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:58:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:54,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:58:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:54,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:58:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:54,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:58:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:54,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:58:54,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:54,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-23 08:58:54,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:54,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-23 08:58:54,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:54,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:58:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 34 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:58:55,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:58:55,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314275872] [2023-11-23 08:58:55,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314275872] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:58:55,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416927497] [2023-11-23 08:58:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:58:55,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:58:55,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:58:55,081 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:58:55,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-23 08:58:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:58:55,318 INFO L262 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 57 conjunts are in the unsatisfiable core [2023-11-23 08:58:55,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:58:55,392 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 20 treesize of output 9 [2023-11-23 08:59:02,586 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2023-11-23 08:59:02,587 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:59:02,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416927497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:59:02,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:59:02,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [16] total 29 [2023-11-23 08:59:02,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064810968] [2023-11-23 08:59:02,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:59:02,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 08:59:02,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:59:02,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 08:59:02,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=736, Unknown=0, NotChecked=0, Total=812 [2023-11-23 08:59:02,588 INFO L87 Difference]: Start difference. First operand 313 states and 399 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 6 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2023-11-23 08:59:04,600 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 08:59:06,620 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 08:59:08,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:59:10,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:59:12,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:59:14,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15