./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.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_push_back_harness.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 d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:52:40,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:52:41,053 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:52:41,056 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:52:41,056 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:52:41,074 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:52:41,074 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:52:41,074 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:52:41,075 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:52:41,075 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:52:41,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:52:41,075 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:52:41,076 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:52:41,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:52:41,088 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:52:41,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:52:41,090 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:52:41,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:52:41,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:52:41,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:52:41,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:52:41,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:52:41,091 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:52:41,092 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:52:41,092 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:52:41,092 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:52:41,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:52:41,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:52:41,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:52:41,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:52:41,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:52:41,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:52:41,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:52:41,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:52:41,094 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:52:41,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:52:41,095 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:52:41,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:52:41,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:52:41,095 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 -> d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:52:41,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:52:41,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:52:41,331 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:52:41,333 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:52:41,333 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:52:41,334 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_push_back_harness.i [2023-11-23 08:52:42,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:52:42,690 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:52:42,691 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.i [2023-11-23 08:52:42,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390d05008/1bce5e01192e48e989052fbd4ec8be0b/FLAGe8dadab45 [2023-11-23 08:52:42,731 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/390d05008/1bce5e01192e48e989052fbd4ec8be0b [2023-11-23 08:52:42,733 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:52:42,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:52:42,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:52:42,736 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:52:42,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:52:42,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:42" (1/1) ... [2023-11-23 08:52:42,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15364295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:42, skipping insertion in model container [2023-11-23 08:52:42,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:42" (1/1) ... [2023-11-23 08:52:42,816 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:52:43,016 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_push_back_harness.i[4499,4512] [2023-11-23 08:52:43,024 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_push_back_harness.i[4559,4572] [2023-11-23 08:52:43,573 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,573 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,574 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,574 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,575 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,589 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,590 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,591 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,592 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,595 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,596 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,596 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,597 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:43,796 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:52:43,799 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:52:43,800 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:52:43,801 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:52:43,802 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:52:43,803 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:52:43,804 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:52:43,804 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:52:43,805 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:52:43,809 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:52:43,940 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:52:43,956 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:52:43,971 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_push_back_harness.i[4499,4512] [2023-11-23 08:52:43,972 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_push_back_harness.i[4559,4572] [2023-11-23 08:52:44,021 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,022 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,022 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,022 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,023 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,034 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,035 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,036 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,036 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,036 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,037 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,037 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,037 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:44,057 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:52:44,060 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:52:44,061 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:52:44,061 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:52:44,068 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:52:44,069 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:52:44,069 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:52:44,069 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:52:44,070 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:52:44,070 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:52:44,096 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:52:44,178 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,179 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,179 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,179 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,179 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,179 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,179 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,179 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,180 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,180 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,180 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,180 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,180 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,180 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,180 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,180 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:44,186 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:52:44,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44 WrapperNode [2023-11-23 08:52:44,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:52:44,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:52:44,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:52:44,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:52:44,192 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:52:44" (1/1) ... [2023-11-23 08:52:44,238 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:52:44" (1/1) ... [2023-11-23 08:52:44,271 INFO L138 Inliner]: procedures = 678, calls = 1048, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 149 [2023-11-23 08:52:44,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:52:44,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:52:44,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:52:44,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:52:44,279 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44" (1/1) ... [2023-11-23 08:52:44,279 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44" (1/1) ... [2023-11-23 08:52:44,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44" (1/1) ... [2023-11-23 08:52:44,287 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44" (1/1) ... [2023-11-23 08:52:44,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44" (1/1) ... [2023-11-23 08:52:44,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44" (1/1) ... [2023-11-23 08:52:44,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44" (1/1) ... [2023-11-23 08:52:44,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44" (1/1) ... [2023-11-23 08:52:44,328 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:52:44,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:52:44,329 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:52:44,329 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:52:44,330 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44" (1/1) ... [2023-11-23 08:52:44,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:52:44,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:44,359 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:52:44,378 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:52:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:52:44,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:52:44,407 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:52:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:52:44,407 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:52:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:52:44,407 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:52:44,408 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:52:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:52:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:52:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2023-11-23 08:52:44,408 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2023-11-23 08:52:44,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:52:44,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:52:44,409 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:52:44,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:52:44,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:52:44,409 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:52:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:52:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:52:44,410 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:52:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:52:44,410 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:52:44,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:52:44,638 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:52:44,640 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:52:44,864 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:52:44,889 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:52:44,890 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:52:44,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:44 BoogieIcfgContainer [2023-11-23 08:52:44,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:52:44,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:52:44,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:52:44,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:52:44,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:42" (1/3) ... [2023-11-23 08:52:44,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35333e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:44, skipping insertion in model container [2023-11-23 08:52:44,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:44" (2/3) ... [2023-11-23 08:52:44,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35333e1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:44, skipping insertion in model container [2023-11-23 08:52:44,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:44" (3/3) ... [2023-11-23 08:52:44,896 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness.i [2023-11-23 08:52:44,908 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:52:44,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:52:44,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:52:44,956 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;@4f782477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:52:44,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:52:44,960 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 08:52:44,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:52:44,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:44,969 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:52:44,970 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:44,974 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:44,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1898793684, now seen corresponding path program 1 times [2023-11-23 08:52:44,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:44,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043062457] [2023-11-23 08:52:44,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:44,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:45,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:52:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:52:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:52:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:52:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:52:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:52:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:52:45,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:45,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043062457] [2023-11-23 08:52:45,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043062457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:45,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:52:45,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:52:45,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562826022] [2023-11-23 08:52:45,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:45,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:52:45,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:45,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:52:45,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:52:45,551 INFO L87 Difference]: Start difference. First operand has 91 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:52:45,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:45,669 INFO L93 Difference]: Finished difference Result 188 states and 290 transitions. [2023-11-23 08:52:45,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:52:45,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2023-11-23 08:52:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:45,678 INFO L225 Difference]: With dead ends: 188 [2023-11-23 08:52:45,678 INFO L226 Difference]: Without dead ends: 101 [2023-11-23 08:52:45,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:52:45,683 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 21 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:45,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 338 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:52:45,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-23 08:52:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2023-11-23 08:52:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 56 states have internal predecessors, (70), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:52:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2023-11-23 08:52:45,716 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 68 [2023-11-23 08:52:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:45,717 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2023-11-23 08:52:45,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:52:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2023-11-23 08:52:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:52:45,718 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:45,719 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:52:45,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:52:45,719 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:45,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:45,719 INFO L85 PathProgramCache]: Analyzing trace with hash 1051641528, now seen corresponding path program 1 times [2023-11-23 08:52:45,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:45,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414866355] [2023-11-23 08:52:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:45,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:45,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:52:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:52:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:45,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:52:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:52:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:52:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:52:46,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,034 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:52:46,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414866355] [2023-11-23 08:52:46,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414866355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:46,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:52:46,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:52:46,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111956214] [2023-11-23 08:52:46,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:46,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:52:46,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:46,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:52:46,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:52:46,038 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:52:46,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:46,108 INFO L93 Difference]: Finished difference Result 180 states and 253 transitions. [2023-11-23 08:52:46,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:52:46,109 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2023-11-23 08:52:46,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:46,112 INFO L225 Difference]: With dead ends: 180 [2023-11-23 08:52:46,112 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 08:52:46,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:52:46,116 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 12 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:46,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 332 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:52:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 08:52:46,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2023-11-23 08:52:46,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:52:46,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 127 transitions. [2023-11-23 08:52:46,135 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 127 transitions. Word has length 68 [2023-11-23 08:52:46,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:46,137 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 127 transitions. [2023-11-23 08:52:46,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:52:46,137 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 127 transitions. [2023-11-23 08:52:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:52:46,140 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:46,140 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:52:46,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 08:52:46,141 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:46,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1036122810, now seen corresponding path program 1 times [2023-11-23 08:52:46,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:46,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387171999] [2023-11-23 08:52:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:46,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:46,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:52:46,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:52:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:52:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:52:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:52:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:52:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,322 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:52:46,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:46,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387171999] [2023-11-23 08:52:46,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387171999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:46,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:52:46,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:52:46,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121938083] [2023-11-23 08:52:46,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:46,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:52:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:52:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:52:46,323 INFO L87 Difference]: Start difference. First operand 93 states and 127 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:52:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:46,375 INFO L93 Difference]: Finished difference Result 180 states and 251 transitions. [2023-11-23 08:52:46,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:52:46,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2023-11-23 08:52:46,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:46,381 INFO L225 Difference]: With dead ends: 180 [2023-11-23 08:52:46,382 INFO L226 Difference]: Without dead ends: 97 [2023-11-23 08:52:46,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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:52:46,386 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 3 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:46,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 331 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:52:46,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-23 08:52:46,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2023-11-23 08:52:46,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 60 states have (on average 1.25) internal successors, (75), 61 states have internal predecessors, (75), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:52:46,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 130 transitions. [2023-11-23 08:52:46,397 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 130 transitions. Word has length 68 [2023-11-23 08:52:46,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:46,397 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 130 transitions. [2023-11-23 08:52:46,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:52:46,397 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 130 transitions. [2023-11-23 08:52:46,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:52:46,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:46,398 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:52:46,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 08:52:46,399 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:46,399 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:46,399 INFO L85 PathProgramCache]: Analyzing trace with hash 683034428, now seen corresponding path program 1 times [2023-11-23 08:52:46,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:46,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819823341] [2023-11-23 08:52:46,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:52:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:52:46,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:52:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:52:46,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:52:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:52:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,646 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:52:46,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:46,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819823341] [2023-11-23 08:52:46,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819823341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:46,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:52:46,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:52:46,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111033935] [2023-11-23 08:52:46,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:46,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:52:46,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:46,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:52:46,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:52:46,648 INFO L87 Difference]: Start difference. First operand 96 states and 130 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:52:46,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:46,726 INFO L93 Difference]: Finished difference Result 189 states and 256 transitions. [2023-11-23 08:52:46,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:52:46,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 68 [2023-11-23 08:52:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:46,728 INFO L225 Difference]: With dead ends: 189 [2023-11-23 08:52:46,728 INFO L226 Difference]: Without dead ends: 94 [2023-11-23 08:52:46,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:52:46,730 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 11 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:46,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 406 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:52:46,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-23 08:52:46,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-23 08:52:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 59 states have internal predecessors, (72), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:52:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2023-11-23 08:52:46,744 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 68 [2023-11-23 08:52:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:46,744 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2023-11-23 08:52:46,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:52:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2023-11-23 08:52:46,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:52:46,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:46,746 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:52:46,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:52:46,746 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:46,746 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:46,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1658640332, now seen corresponding path program 1 times [2023-11-23 08:52:46,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:46,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030614555] [2023-11-23 08:52:46,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:46,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:52:46,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:52:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:46,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-23 08:52:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:47,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-23 08:52:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:47,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-23 08:52:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:47,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-23 08:52:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:47,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-23 08:52:47,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:47,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:52:47,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:47,045 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:52:47,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:47,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030614555] [2023-11-23 08:52:47,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030614555] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:47,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959785935] [2023-11-23 08:52:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:47,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:47,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:47,047 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:52:47,064 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:52:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:47,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 106 conjunts are in the unsatisfiable core [2023-11-23 08:52:47,259 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:47,310 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 10 treesize of output 8 [2023-11-23 08:52:47,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 12 [2023-11-23 08:52:47,446 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 8 treesize of output 1 [2023-11-23 08:52:47,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:52:47,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:52:47,978 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 08:52:47,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:52:48,008 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-23 08:52:48,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 244 [2023-11-23 08:52:48,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:52:48,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 77 [2023-11-23 08:52:48,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 94 treesize of output 49 [2023-11-23 08:52:48,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 55 treesize of output 47 [2023-11-23 08:52:48,077 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 35 treesize of output 21 [2023-11-23 08:52:48,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 11 [2023-11-23 08:52:48,097 INFO L349 Elim1Store]: treesize reduction 114, result has 7.3 percent of original size [2023-11-23 08:52:48,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 104 treesize of output 103 [2023-11-23 08:52:48,103 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:52:48,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 64 treesize of output 42 [2023-11-23 08:52:48,113 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 25 treesize of output 21 [2023-11-23 08:52:48,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 1 [2023-11-23 08:52:48,503 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 08:52:48,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:52:49,830 INFO L349 Elim1Store]: treesize reduction 994, result has 30.6 percent of original size [2023-11-23 08:52:49,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 1482 treesize of output 1487 [2023-11-23 08:52:50,163 INFO L349 Elim1Store]: treesize reduction 1079, result has 2.2 percent of original size [2023-11-23 08:52:50,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 3131 treesize of output 3267 [2023-11-23 08:52:50,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:50,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 53 [2023-11-23 08:52:50,902 INFO L349 Elim1Store]: treesize reduction 76, result has 1.3 percent of original size [2023-11-23 08:52:50,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 895 treesize of output 1 [2023-11-23 08:52:51,050 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:52:51,074 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:51,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 86 [2023-11-23 08:52:51,410 INFO L349 Elim1Store]: treesize reduction 78, result has 14.3 percent of original size [2023-11-23 08:52:51,410 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 2375 treesize of output 2346 [2023-11-23 08:52:51,430 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 5 treesize of output 3 [2023-11-23 08:52:51,472 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:52:51,490 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:52:51,548 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:52:51,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:51,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 259 treesize of output 291 [2023-11-23 08:52:51,902 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:51,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 282 treesize of output 322 [2023-11-23 08:52:52,073 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:52:52,074 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 159 treesize of output 163 [2023-11-23 08:52:52,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959785935] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:52,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:52:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19] total 23 [2023-11-23 08:52:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727428064] [2023-11-23 08:52:52,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:52:52,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-23 08:52:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:52,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-23 08:52:52,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=849, Unknown=0, NotChecked=0, Total=930 [2023-11-23 08:52:52,349 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 23 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 8 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2023-11-23 08:52:54,360 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:52:56,435 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:52:58,442 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:53:00,468 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:53:02,511 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:53:04,523 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:53:07,055 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:53:09,493 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:53:10,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:10,170 INFO L93 Difference]: Finished difference Result 317 states and 429 transitions. [2023-11-23 08:53:10,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-23 08:53:10,171 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 8 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) Word has length 68 [2023-11-23 08:53:10,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:10,173 INFO L225 Difference]: With dead ends: 317 [2023-11-23 08:53:10,173 INFO L226 Difference]: Without dead ends: 225 [2023-11-23 08:53:10,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 63 SyntacticMatches, 11 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=146, Invalid=1576, Unknown=0, NotChecked=0, Total=1722 [2023-11-23 08:53:10,174 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 132 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 20 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 1216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:10,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1606 Invalid, 1216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1188 Invalid, 8 Unknown, 0 Unchecked, 17.4s Time] [2023-11-23 08:53:10,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-11-23 08:53:10,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 218. [2023-11-23 08:53:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 142 states have (on average 1.2535211267605635) internal successors, (178), 146 states have internal predecessors, (178), 56 states have call successors, (56), 17 states have call predecessors, (56), 19 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2023-11-23 08:53:10,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 293 transitions. [2023-11-23 08:53:10,190 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 293 transitions. Word has length 68 [2023-11-23 08:53:10,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:10,190 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 293 transitions. [2023-11-23 08:53:10,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 3.736842105263158) internal successors, (71), 18 states have internal predecessors, (71), 8 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (18), 7 states have call predecessors, (18), 7 states have call successors, (18) [2023-11-23 08:53:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 293 transitions. [2023-11-23 08:53:10,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:53:10,192 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:10,192 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:10,209 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:53:10,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:10,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:10,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:10,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1275850490, now seen corresponding path program 1 times [2023-11-23 08:53:10,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:10,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028769956] [2023-11-23 08:53:10,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:10,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:10,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-23 08:53:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:10,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-23 08:53:10,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:53:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:53:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:53:10,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:10,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028769956] [2023-11-23 08:53:10,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028769956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:10,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:10,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:53:10,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823293443] [2023-11-23 08:53:10,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:10,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:53:10,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:10,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:53:10,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:53:10,621 INFO L87 Difference]: Start difference. First operand 218 states and 293 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:10,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:10,715 INFO L93 Difference]: Finished difference Result 402 states and 547 transitions. [2023-11-23 08:53:10,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:53:10,716 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 70 [2023-11-23 08:53:10,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:10,718 INFO L225 Difference]: With dead ends: 402 [2023-11-23 08:53:10,719 INFO L226 Difference]: Without dead ends: 218 [2023-11-23 08:53:10,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:53:10,720 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 34 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:10,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 548 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-11-23 08:53:10,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2023-11-23 08:53:10,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 142 states have (on average 1.232394366197183) internal successors, (175), 146 states have internal predecessors, (175), 56 states have call successors, (56), 17 states have call predecessors, (56), 19 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2023-11-23 08:53:10,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 290 transitions. [2023-11-23 08:53:10,737 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 290 transitions. Word has length 70 [2023-11-23 08:53:10,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:10,738 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 290 transitions. [2023-11-23 08:53:10,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 7 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:10,738 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 290 transitions. [2023-11-23 08:53:10,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-23 08:53:10,739 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:10,739 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:10,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 08:53:10,739 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:10,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:10,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1743090387, now seen corresponding path program 1 times [2023-11-23 08:53:10,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:10,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786590333] [2023-11-23 08:53:10,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:10,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:10,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:10,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:10,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-23 08:53:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-23 08:53:10,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-23 08:53:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-23 08:53:10,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-23 08:53:10,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-23 08:53:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:10,922 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:53:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786590333] [2023-11-23 08:53:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786590333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:10,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:53:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387767142] [2023-11-23 08:53:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:10,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:53:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:10,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:53:10,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:53:10,925 INFO L87 Difference]: Start difference. First operand 218 states and 290 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:11,005 INFO L93 Difference]: Finished difference Result 412 states and 555 transitions. [2023-11-23 08:53:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:53:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2023-11-23 08:53:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:11,008 INFO L225 Difference]: With dead ends: 412 [2023-11-23 08:53:11,008 INFO L226 Difference]: Without dead ends: 227 [2023-11-23 08:53:11,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:11,009 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 16 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:11,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 391 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:53:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-23 08:53:11,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 221. [2023-11-23 08:53:11,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 149 states have internal predecessors, (178), 56 states have call successors, (56), 17 states have call predecessors, (56), 19 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2023-11-23 08:53:11,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 293 transitions. [2023-11-23 08:53:11,029 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 293 transitions. Word has length 72 [2023-11-23 08:53:11,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:11,030 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 293 transitions. [2023-11-23 08:53:11,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:11,030 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 293 transitions. [2023-11-23 08:53:11,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-23 08:53:11,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:11,032 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:11,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 08:53:11,033 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:11,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash 343946757, now seen corresponding path program 1 times [2023-11-23 08:53:11,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:11,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747463415] [2023-11-23 08:53:11,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:11,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-23 08:53:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-23 08:53:11,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:53:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 08:53:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-23 08:53:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-23 08:53:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:53:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:11,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747463415] [2023-11-23 08:53:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747463415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:11,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:53:11,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243847766] [2023-11-23 08:53:11,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:11,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:53:11,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:11,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:53:11,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:53:11,210 INFO L87 Difference]: Start difference. First operand 221 states and 293 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:11,266 INFO L93 Difference]: Finished difference Result 420 states and 569 transitions. [2023-11-23 08:53:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:53:11,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2023-11-23 08:53:11,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:11,268 INFO L225 Difference]: With dead ends: 420 [2023-11-23 08:53:11,268 INFO L226 Difference]: Without dead ends: 233 [2023-11-23 08:53:11,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:11,269 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 13 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:11,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 396 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:53:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-23 08:53:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2023-11-23 08:53:11,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 148 states have (on average 1.222972972972973) internal successors, (181), 152 states have internal predecessors, (181), 56 states have call successors, (56), 17 states have call predecessors, (56), 19 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2023-11-23 08:53:11,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 296 transitions. [2023-11-23 08:53:11,281 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 296 transitions. Word has length 73 [2023-11-23 08:53:11,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:11,282 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 296 transitions. [2023-11-23 08:53:11,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:11,282 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 296 transitions. [2023-11-23 08:53:11,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:53:11,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:11,283 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:11,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 08:53:11,283 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:11,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:11,283 INFO L85 PathProgramCache]: Analyzing trace with hash -2083555045, now seen corresponding path program 1 times [2023-11-23 08:53:11,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:11,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645642616] [2023-11-23 08:53:11,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:11,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:11,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-23 08:53:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-23 08:53:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-23 08:53:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-23 08:53:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-23 08:53:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-23 08:53:11,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-23 08:53:11,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-11-23 08:53:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-23 08:53:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:53:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645642616] [2023-11-23 08:53:11,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645642616] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:11,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246295875] [2023-11-23 08:53:11,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:11,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:11,532 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:53:11,535 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:53:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:11,709 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-23 08:53:11,712 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:12,203 INFO L349 Elim1Store]: treesize reduction 300, result has 32.6 percent of original size [2023-11-23 08:53:12,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 326 treesize of output 795 [2023-11-23 08:53:12,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 501 treesize of output 425 [2023-11-23 08:53:12,393 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:12,533 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:53:12,577 INFO L224 Elim1Store]: Index analysis took 310 ms [2023-11-23 08:53:12,716 INFO L349 Elim1Store]: treesize reduction 559, result has 4.9 percent of original size [2023-11-23 08:53:12,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 26 case distinctions, treesize of input 229 treesize of output 404 [2023-11-23 08:53:12,972 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 25 treesize of output 19 [2023-11-23 08:53:20,570 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-23 08:53:20,587 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:53:20,782 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,SelfDestructingSolverStorable8 [2023-11-23 08:53:20,783 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 08:53:20,787 INFO L158 Benchmark]: Toolchain (without parser) took 38052.04ms. Allocated memory was 165.7MB in the beginning and 448.8MB in the end (delta: 283.1MB). Free memory was 83.7MB in the beginning and 393.7MB in the end (delta: -310.1MB). Peak memory consumption was 232.0MB. Max. memory is 16.1GB. [2023-11-23 08:53:20,787 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:53:20,787 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1451.11ms. Allocated memory was 165.7MB in the beginning and 226.5MB in the end (delta: 60.8MB). Free memory was 83.5MB in the beginning and 97.5MB in the end (delta: -14.0MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2023-11-23 08:53:20,787 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.37ms. Allocated memory is still 226.5MB. Free memory was 97.5MB in the beginning and 92.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:53:20,787 INFO L158 Benchmark]: Boogie Preprocessor took 56.31ms. Allocated memory is still 226.5MB. Free memory was 92.3MB in the beginning and 89.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:53:20,788 INFO L158 Benchmark]: RCFGBuilder took 561.46ms. Allocated memory is still 226.5MB. Free memory was 89.2MB in the beginning and 171.7MB in the end (delta: -82.6MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. [2023-11-23 08:53:20,788 INFO L158 Benchmark]: TraceAbstraction took 35894.51ms. Allocated memory was 226.5MB in the beginning and 448.8MB in the end (delta: 222.3MB). Free memory was 170.7MB in the beginning and 393.7MB in the end (delta: -223.0MB). Peak memory consumption was 256.5MB. Max. memory is 16.1GB. [2023-11-23 08:53:20,789 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 165.7MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1451.11ms. Allocated memory was 165.7MB in the beginning and 226.5MB in the end (delta: 60.8MB). Free memory was 83.5MB in the beginning and 97.5MB in the end (delta: -14.0MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.37ms. Allocated memory is still 226.5MB. Free memory was 97.5MB in the beginning and 92.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.31ms. Allocated memory is still 226.5MB. Free memory was 92.3MB in the beginning and 89.2MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 561.46ms. Allocated memory is still 226.5MB. Free memory was 89.2MB in the beginning and 171.7MB in the end (delta: -82.6MB). Peak memory consumption was 31.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35894.51ms. Allocated memory was 226.5MB in the beginning and 448.8MB in the end (delta: 222.3MB). Free memory was 170.7MB in the beginning and 393.7MB in the end (delta: -223.0MB). Peak memory consumption was 256.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-23 08:53:20,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_push_back_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:53:22,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:53:22,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2023-11-23 08:53:22,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:53:22,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:53:22,736 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:53:22,736 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:53:22,737 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:53:22,737 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:53:22,740 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:53:22,740 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:53:22,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:53:22,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:53:22,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:53:22,742 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:53:22,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:53:22,743 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:53:22,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:53:22,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:53:22,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:53:22,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:53:22,744 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 08:53:22,744 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 08:53:22,744 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 08:53:22,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:53:22,745 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:53:22,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:53:22,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:53:22,746 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:53:22,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:53:22,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:53:22,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:53:22,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:53:22,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:53:22,748 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 08:53:22,748 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 08:53:22,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:53:22,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:53:22,749 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:53:22,749 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:53:22,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:53:22,749 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 08:53:22,750 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 -> d155cc00d5c2ba6f5ef1d5e883c6d133605de01ed97e4300960f893025d81fd1 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:53:23,021 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:53:23,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:53:23,046 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:53:23,047 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:53:23,048 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:53:23,049 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_push_back_harness.i [2023-11-23 08:53:24,030 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:53:24,375 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:53:24,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_push_back_harness.i [2023-11-23 08:53:24,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f5055efe/e106469356bf4af39e49f96d91a9973b/FLAG49eaec1d2 [2023-11-23 08:53:24,416 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f5055efe/e106469356bf4af39e49f96d91a9973b [2023-11-23 08:53:24,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:53:24,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:53:24,421 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:53:24,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:53:24,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:53:24,425 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:24" (1/1) ... [2023-11-23 08:53:24,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25e19e8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:24, skipping insertion in model container [2023-11-23 08:53:24,426 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:53:24" (1/1) ... [2023-11-23 08:53:24,492 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:53:24,675 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_push_back_harness.i[4499,4512] [2023-11-23 08:53:24,681 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_push_back_harness.i[4559,4572] [2023-11-23 08:53:25,235 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,235 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,236 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,240 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,242 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,249 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,250 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,251 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,257 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,259 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,260 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,261 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,261 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,491 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:53:25,492 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:53:25,492 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:53:25,494 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:53:25,494 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:53:25,495 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:53:25,496 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:53:25,496 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:53:25,497 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:53:25,506 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:53:25,651 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:53:25,674 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-23 08:53:25,697 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:53:25,702 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_push_back_harness.i[4499,4512] [2023-11-23 08:53:25,702 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_push_back_harness.i[4559,4572] [2023-11-23 08:53:25,761 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,761 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,762 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,763 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,763 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,771 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,772 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,773 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,773 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,774 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,774 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,775 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,775 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,813 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:53:25,815 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:53:25,816 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:53:25,816 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:53:25,817 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:53:25,818 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:53:25,818 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:53:25,819 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:53:25,819 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:53:25,820 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:53:25,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:53:25,863 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:53:25,882 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_push_back_harness.i[4499,4512] [2023-11-23 08:53:25,883 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_push_back_harness.i[4559,4572] [2023-11-23 08:53:25,918 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,919 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,919 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,919 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,920 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,930 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,931 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,931 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,931 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,933 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,933 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,934 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,934 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:53:25,956 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:53:25,956 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:53:25,957 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:53:25,957 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:53:25,958 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:53:25,958 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:53:25,958 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:53:25,958 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:53:25,959 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:53:25,959 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:53:25,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:53:26,144 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,145 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,145 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,145 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,145 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,145 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,145 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,146 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,146 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,146 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,146 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,146 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,146 WARN L675 CHandler]: The function memcmp is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,146 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,147 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,147 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:53:26,153 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:53:26,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26 WrapperNode [2023-11-23 08:53:26,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:53:26,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:53:26,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:53:26,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:53:26,160 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:53:26" (1/1) ... [2023-11-23 08:53:26,217 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:53:26" (1/1) ... [2023-11-23 08:53:26,246 INFO L138 Inliner]: procedures = 697, calls = 1048, calls flagged for inlining = 52, calls inlined = 6, statements flattened = 150 [2023-11-23 08:53:26,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:53:26,247 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:53:26,247 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:53:26,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:53:26,254 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26" (1/1) ... [2023-11-23 08:53:26,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26" (1/1) ... [2023-11-23 08:53:26,259 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26" (1/1) ... [2023-11-23 08:53:26,259 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26" (1/1) ... [2023-11-23 08:53:26,271 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26" (1/1) ... [2023-11-23 08:53:26,274 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26" (1/1) ... [2023-11-23 08:53:26,278 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26" (1/1) ... [2023-11-23 08:53:26,279 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26" (1/1) ... [2023-11-23 08:53:26,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:53:26,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:53:26,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:53:26,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:53:26,285 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26" (1/1) ... [2023-11-23 08:53:26,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:53:26,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:26,326 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:53:26,364 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:53:26,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:53:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-23 08:53:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:53:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:53:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:53:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:53:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 08:53:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2023-11-23 08:53:26,391 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2023-11-23 08:53:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:53:26,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:53:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_insert_before [2023-11-23 08:53:26,392 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_insert_before [2023-11-23 08:53:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:53:26,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:53:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:53:26,392 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:53:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:53:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:53:26,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:53:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2023-11-23 08:53:26,393 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2023-11-23 08:53:26,393 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:53:26,393 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:53:26,617 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:53:26,619 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:53:27,011 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:53:27,053 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:53:27,053 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-23 08:53:27,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:27 BoogieIcfgContainer [2023-11-23 08:53:27,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:53:27,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:53:27,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:53:27,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:53:27,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:53:24" (1/3) ... [2023-11-23 08:53:27,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58918320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:27, skipping insertion in model container [2023-11-23 08:53:27,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:53:26" (2/3) ... [2023-11-23 08:53:27,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58918320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:53:27, skipping insertion in model container [2023-11-23 08:53:27,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:53:27" (3/3) ... [2023-11-23 08:53:27,060 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_push_back_harness.i [2023-11-23 08:53:27,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:53:27,074 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:53:27,114 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:53:27,123 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;@17acf4cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:53:27,123 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:53:27,127 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-23 08:53:27,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:53:27,145 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:27,146 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:53:27,146 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:27,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1898793684, now seen corresponding path program 1 times [2023-11-23 08:53:27,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:27,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757099433] [2023-11-23 08:53:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:27,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:27,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:27,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:27,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-23 08:53:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:27,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-23 08:53:27,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:27,459 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2023-11-23 08:53:27,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:27,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:27,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757099433] [2023-11-23 08:53:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757099433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:27,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:27,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:53:27,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98197414] [2023-11-23 08:53:27,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:53:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:53:27,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:53:27,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:53:27,500 INFO L87 Difference]: Start difference. First operand has 91 states, 54 states have (on average 1.3518518518518519) internal successors, (73), 55 states have internal predecessors, (73), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:53:27,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:27,563 INFO L93 Difference]: Finished difference Result 176 states and 271 transitions. [2023-11-23 08:53:27,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:53:27,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2023-11-23 08:53:27,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:27,570 INFO L225 Difference]: With dead ends: 176 [2023-11-23 08:53:27,570 INFO L226 Difference]: Without dead ends: 89 [2023-11-23 08:53:27,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:53:27,575 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:27,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:53:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-23 08:53:27,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-23 08:53:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 54 states have internal predecessors, (68), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:53:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2023-11-23 08:53:27,606 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 68 [2023-11-23 08:53:27,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:27,606 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2023-11-23 08:53:27,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-23 08:53:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2023-11-23 08:53:27,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:53:27,608 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:27,608 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:53:27,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:27,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:27,813 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:27,814 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:27,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1214739658, now seen corresponding path program 1 times [2023-11-23 08:53:27,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:27,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10829059] [2023-11-23 08:53:27,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:27,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:27,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:27,816 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:27,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-23 08:53:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:28,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-23 08:53:28,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:53:28,134 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:28,134 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:28,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10829059] [2023-11-23 08:53:28,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [10829059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:28,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:28,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:53:28,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280500688] [2023-11-23 08:53:28,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:28,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:53:28,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:53:28,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:53:28,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:28,136 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:28,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:28,283 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2023-11-23 08:53:28,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:53:28,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 68 [2023-11-23 08:53:28,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:28,286 INFO L225 Difference]: With dead ends: 184 [2023-11-23 08:53:28,286 INFO L226 Difference]: Without dead ends: 89 [2023-11-23 08:53:28,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:53:28,290 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 25 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:28,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 522 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:28,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-23 08:53:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-23 08:53:28,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 54 states have internal predecessors, (67), 28 states have call successors, (28), 7 states have call predecessors, (28), 7 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 08:53:28,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 122 transitions. [2023-11-23 08:53:28,304 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 122 transitions. Word has length 68 [2023-11-23 08:53:28,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:28,305 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 122 transitions. [2023-11-23 08:53:28,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:28,305 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 122 transitions. [2023-11-23 08:53:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-11-23 08:53:28,306 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:28,306 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 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:53:28,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:28,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:28,507 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:28,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:28,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1658640332, now seen corresponding path program 1 times [2023-11-23 08:53:28,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:28,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103243179] [2023-11-23 08:53:28,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:28,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:28,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:28,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:28,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-23 08:53:28,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:28,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 08:53:28,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:53:28,744 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:28,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:28,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103243179] [2023-11-23 08:53:28,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103243179] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:28,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:28,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:53:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817591717] [2023-11-23 08:53:28,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:28,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:53:28,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:53:28,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:53:28,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:28,747 INFO L87 Difference]: Start difference. First operand 89 states and 122 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:28,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:28,922 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2023-11-23 08:53:28,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:53:28,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 68 [2023-11-23 08:53:28,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:28,927 INFO L225 Difference]: With dead ends: 170 [2023-11-23 08:53:28,928 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 08:53:28,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:53:28,929 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 2 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:28,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 523 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:53:28,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 08:53:28,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-23 08:53:28,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 56 states have internal predecessors, (68), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2023-11-23 08:53:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 125 transitions. [2023-11-23 08:53:28,942 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 125 transitions. Word has length 68 [2023-11-23 08:53:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:28,942 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 125 transitions. [2023-11-23 08:53:28,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 125 transitions. [2023-11-23 08:53:28,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:53:28,943 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:28,944 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:28,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:29,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:29,159 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:29,159 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:29,159 INFO L85 PathProgramCache]: Analyzing trace with hash -499156872, now seen corresponding path program 1 times [2023-11-23 08:53:29,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:29,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258773510] [2023-11-23 08:53:29,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:29,160 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:29,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:29,161 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:29,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-23 08:53:29,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:29,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 08:53:29,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:53:29,420 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:29,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:29,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258773510] [2023-11-23 08:53:29,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258773510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:29,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:29,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:53:29,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528421039] [2023-11-23 08:53:29,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:29,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:53:29,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:53:29,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:53:29,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:53:29,424 INFO L87 Difference]: Start difference. First operand 91 states and 125 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:29,669 INFO L93 Difference]: Finished difference Result 175 states and 242 transitions. [2023-11-23 08:53:29,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:53:29,670 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 70 [2023-11-23 08:53:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:29,671 INFO L225 Difference]: With dead ends: 175 [2023-11-23 08:53:29,671 INFO L226 Difference]: Without dead ends: 91 [2023-11-23 08:53:29,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:53:29,672 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:29,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 543 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:53:29,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-23 08:53:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2023-11-23 08:53:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 56 states have internal predecessors, (67), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2023-11-23 08:53:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 124 transitions. [2023-11-23 08:53:29,680 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 124 transitions. Word has length 70 [2023-11-23 08:53:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:29,681 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 124 transitions. [2023-11-23 08:53:29,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 124 transitions. [2023-11-23 08:53:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2023-11-23 08:53:29,682 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:29,682 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:29,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-23 08:53:29,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:29,889 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:29,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:29,889 INFO L85 PathProgramCache]: Analyzing trace with hash 776869547, now seen corresponding path program 1 times [2023-11-23 08:53:29,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:29,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [694569646] [2023-11-23 08:53:29,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:29,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:29,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:29,891 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:29,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-23 08:53:30,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:30,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:53:30,086 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:30,175 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:53:30,175 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:30,175 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:30,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [694569646] [2023-11-23 08:53:30,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [694569646] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:30,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:30,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 08:53:30,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324220327] [2023-11-23 08:53:30,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:30,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:53:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:53:30,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:53:30,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:53:30,176 INFO L87 Difference]: Start difference. First operand 91 states and 124 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:30,455 INFO L93 Difference]: Finished difference Result 182 states and 251 transitions. [2023-11-23 08:53:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:53:30,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 72 [2023-11-23 08:53:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:30,457 INFO L225 Difference]: With dead ends: 182 [2023-11-23 08:53:30,457 INFO L226 Difference]: Without dead ends: 97 [2023-11-23 08:53:30,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-11-23 08:53:30,458 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 59 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:30,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 624 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:53:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-23 08:53:30,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2023-11-23 08:53:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 57 states have internal predecessors, (68), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2023-11-23 08:53:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 125 transitions. [2023-11-23 08:53:30,467 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 125 transitions. Word has length 72 [2023-11-23 08:53:30,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:30,468 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 125 transitions. [2023-11-23 08:53:30,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:30,468 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 125 transitions. [2023-11-23 08:53:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-11-23 08:53:30,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:30,469 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:30,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:30,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:30,679 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:30,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1431060605, now seen corresponding path program 1 times [2023-11-23 08:53:30,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:30,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [537339030] [2023-11-23 08:53:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:30,680 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:30,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:30,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:30,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-23 08:53:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:30,888 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-23 08:53:30,890 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:30,965 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:53:30,966 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:30,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:30,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [537339030] [2023-11-23 08:53:30,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [537339030] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:30,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:30,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:53:30,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076277210] [2023-11-23 08:53:30,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:30,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:53:30,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:53:30,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:53:30,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:53:30,967 INFO L87 Difference]: Start difference. First operand 92 states and 125 transitions. Second operand has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:31,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:31,197 INFO L93 Difference]: Finished difference Result 178 states and 247 transitions. [2023-11-23 08:53:31,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 08:53:31,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2023-11-23 08:53:31,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:31,199 INFO L225 Difference]: With dead ends: 178 [2023-11-23 08:53:31,199 INFO L226 Difference]: Without dead ends: 96 [2023-11-23 08:53:31,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:53:31,200 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 41 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:31,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 529 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:53:31,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-23 08:53:31,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2023-11-23 08:53:31,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 58 states have internal predecessors, (69), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2023-11-23 08:53:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 126 transitions. [2023-11-23 08:53:31,206 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 126 transitions. Word has length 73 [2023-11-23 08:53:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:31,206 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 126 transitions. [2023-11-23 08:53:31,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.5) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-23 08:53:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 126 transitions. [2023-11-23 08:53:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-23 08:53:31,207 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:31,207 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:31,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:31,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:31,408 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:31,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:31,408 INFO L85 PathProgramCache]: Analyzing trace with hash 436404889, now seen corresponding path program 1 times [2023-11-23 08:53:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:31,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274361014] [2023-11-23 08:53:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:31,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:31,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:31,410 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:31,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-23 08:53:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:31,620 INFO L262 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 08:53:31,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-23 08:53:31,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:31,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:31,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274361014] [2023-11-23 08:53:31,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274361014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:31,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:31,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 08:53:31,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145662923] [2023-11-23 08:53:31,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:31,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 08:53:31,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:53:31,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 08:53:31,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-23 08:53:31,663 INFO L87 Difference]: Start difference. First operand 93 states and 126 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:53:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:31,850 INFO L93 Difference]: Finished difference Result 179 states and 244 transitions. [2023-11-23 08:53:31,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:53:31,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 80 [2023-11-23 08:53:31,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:31,854 INFO L225 Difference]: With dead ends: 179 [2023-11-23 08:53:31,854 INFO L226 Difference]: Without dead ends: 96 [2023-11-23 08:53:31,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-23 08:53:31,855 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:31,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 633 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:53:31,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-23 08:53:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2023-11-23 08:53:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 59 states have internal predecessors, (70), 28 states have call successors, (28), 7 states have call predecessors, (28), 8 states have return successors, (29), 27 states have call predecessors, (29), 27 states have call successors, (29) [2023-11-23 08:53:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 127 transitions. [2023-11-23 08:53:31,862 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 127 transitions. Word has length 80 [2023-11-23 08:53:31,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:31,862 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 127 transitions. [2023-11-23 08:53:31,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:53:31,862 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 127 transitions. [2023-11-23 08:53:31,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:53:31,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:31,863 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:31,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:32,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:32,064 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:32,064 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:32,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2091410292, now seen corresponding path program 1 times [2023-11-23 08:53:32,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:32,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115301509] [2023-11-23 08:53:32,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:32,065 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:32,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:32,066 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:32,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-23 08:53:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:32,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-23 08:53:32,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:34,519 WARN L876 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| (_ BitVec 64)) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| (_ BitVec 64))) (not (= (_ bv0 64) (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|))))) is different from true [2023-11-23 08:53:34,738 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-11-23 08:53:34,738 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:34,999 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2023-11-23 08:53:34,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:34,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115301509] [2023-11-23 08:53:34,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115301509] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:53:34,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:53:34,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2023-11-23 08:53:35,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151171086] [2023-11-23 08:53:35,000 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 08:53:35,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-23 08:53:35,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:53:35,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-23 08:53:35,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=171, Unknown=1, NotChecked=26, Total=240 [2023-11-23 08:53:35,001 INFO L87 Difference]: Start difference. First operand 94 states and 127 transitions. Second operand has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-23 08:53:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:36,412 INFO L93 Difference]: Finished difference Result 239 states and 335 transitions. [2023-11-23 08:53:36,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-23 08:53:36,412 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 82 [2023-11-23 08:53:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:36,414 INFO L225 Difference]: With dead ends: 239 [2023-11-23 08:53:36,414 INFO L226 Difference]: Without dead ends: 155 [2023-11-23 08:53:36,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 147 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=111, Invalid=354, Unknown=1, NotChecked=40, Total=506 [2023-11-23 08:53:36,415 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 207 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 301 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:36,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 787 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 379 Invalid, 0 Unknown, 301 Unchecked, 1.1s Time] [2023-11-23 08:53:36,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-11-23 08:53:36,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 111. [2023-11-23 08:53:36,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.2638888888888888) internal successors, (91), 74 states have internal predecessors, (91), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-23 08:53:36,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2023-11-23 08:53:36,423 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 82 [2023-11-23 08:53:36,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:36,424 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2023-11-23 08:53:36,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.375) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2023-11-23 08:53:36,424 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2023-11-23 08:53:36,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:53:36,424 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:36,424 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:36,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:36,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:36,631 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:36,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:36,632 INFO L85 PathProgramCache]: Analyzing trace with hash 517377166, now seen corresponding path program 1 times [2023-11-23 08:53:36,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:36,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460183814] [2023-11-23 08:53:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:36,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:36,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:36,633 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:36,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-23 08:53:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:36,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-23 08:53:36,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:36,828 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-23 08:53:36,828 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:36,828 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:36,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460183814] [2023-11-23 08:53:36,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460183814] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:36,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:36,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 08:53:36,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746922273] [2023-11-23 08:53:36,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:36,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 08:53:36,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:53:36,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 08:53:36,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 08:53:36,830 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:53:36,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:36,945 INFO L93 Difference]: Finished difference Result 215 states and 299 transitions. [2023-11-23 08:53:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:53:36,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2023-11-23 08:53:36,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:36,946 INFO L225 Difference]: With dead ends: 215 [2023-11-23 08:53:36,946 INFO L226 Difference]: Without dead ends: 114 [2023-11-23 08:53:36,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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:53:36,947 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 8 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:36,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 337 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-23 08:53:36,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2023-11-23 08:53:36,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.25) internal successors, (90), 74 states have internal predecessors, (90), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-23 08:53:36,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 150 transitions. [2023-11-23 08:53:36,953 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 150 transitions. Word has length 82 [2023-11-23 08:53:36,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:36,954 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 150 transitions. [2023-11-23 08:53:36,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:53:36,954 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 150 transitions. [2023-11-23 08:53:36,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-11-23 08:53:36,954 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:36,954 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:36,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:37,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:37,161 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:37,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash 99980560, now seen corresponding path program 1 times [2023-11-23 08:53:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941000122] [2023-11-23 08:53:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:37,170 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:37,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:37,171 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:37,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-23 08:53:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:37,368 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-23 08:53:37,370 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2023-11-23 08:53:37,384 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:37,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:37,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941000122] [2023-11-23 08:53:37,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941000122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:37,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:37,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:53:37,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920639408] [2023-11-23 08:53:37,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:37,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:53:37,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:53:37,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:53:37,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:53:37,386 INFO L87 Difference]: Start difference. First operand 111 states and 150 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:53:37,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:37,516 INFO L93 Difference]: Finished difference Result 213 states and 296 transitions. [2023-11-23 08:53:37,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:53:37,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 82 [2023-11-23 08:53:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:37,517 INFO L225 Difference]: With dead ends: 213 [2023-11-23 08:53:37,517 INFO L226 Difference]: Without dead ends: 112 [2023-11-23 08:53:37,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-23 08:53:37,518 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 6 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:37,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 435 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:37,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-23 08:53:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2023-11-23 08:53:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 71 states have internal predecessors, (85), 29 states have call successors, (29), 8 states have call predecessors, (29), 9 states have return successors, (31), 28 states have call predecessors, (31), 28 states have call successors, (31) [2023-11-23 08:53:37,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2023-11-23 08:53:37,525 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 82 [2023-11-23 08:53:37,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:37,525 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2023-11-23 08:53:37,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2023-11-23 08:53:37,525 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2023-11-23 08:53:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 08:53:37,525 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:37,525 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:37,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:37,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:37,732 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:37,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:37,732 INFO L85 PathProgramCache]: Analyzing trace with hash -153422398, now seen corresponding path program 1 times [2023-11-23 08:53:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:53:37,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202074841] [2023-11-23 08:53:37,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:37,733 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:53:37,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:53:37,734 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:53:37,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-23 08:53:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:38,032 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-23 08:53:38,036 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:38,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-11-23 08:53:38,200 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 08:53:38,200 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 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 08:53:38,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-23 08:53:40,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:40,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:43,037 INFO L349 Elim1Store]: treesize reduction 372, result has 25.7 percent of original size [2023-11-23 08:53:43,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 443 treesize of output 517 [2023-11-23 08:53:43,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:43,142 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2023-11-23 08:53:43,142 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 213 treesize of output 80 [2023-11-23 08:53:43,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 91 [2023-11-23 08:53:43,266 INFO L349 Elim1Store]: treesize reduction 62, result has 49.6 percent of original size [2023-11-23 08:53:43,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 67 treesize of output 113 [2023-11-23 08:53:43,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 128 treesize of output 105 [2023-11-23 08:53:43,324 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:53:43,324 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 93 treesize of output 81 [2023-11-23 08:53:43,334 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 108 treesize of output 70 [2023-11-23 08:53:46,655 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 08:53:46,655 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:47,750 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 1368 treesize of output 1350 [2023-11-23 08:53:48,399 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 410 treesize of output 374 [2023-11-23 08:53:50,440 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base)) (.cse2 (bvadd (_ bv8 64) c_aws_linked_list_insert_before_~before.offset))) (and (not (= c_aws_linked_list_insert_before_~to_add.base c_aws_linked_list_insert_before_~before.base)) (forall ((v_ArrVal_559 (Array (_ BitVec 64) (_ BitVec 64))) (aws_linked_list_insert_before_~to_add.offset (_ BitVec 64))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base (let ((.cse3 (store .cse4 aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.base))) (store .cse3 (bvadd (_ bv8 64) aws_linked_list_insert_before_~to_add.offset) (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base .cse3) c_aws_linked_list_insert_before_~before.base) .cse2)))))) (let ((.cse1 (select (select .cse0 c_aws_linked_list_insert_before_~before.base) .cse2))) (store (store .cse0 .cse1 v_ArrVal_559) c_aws_linked_list_insert_before_~before.base (store (select (store .cse0 .cse1 (store (select .cse0 .cse1) c_aws_linked_list_insert_before_~before.offset c_aws_linked_list_insert_before_~to_add.base)) c_aws_linked_list_insert_before_~before.base) .cse2 c_aws_linked_list_insert_before_~to_add.base)))) c_aws_linked_list_insert_before_~to_add.base) aws_linked_list_insert_before_~to_add.offset) c_aws_linked_list_insert_before_~before.base)) (forall ((v_ArrVal_559 (Array (_ BitVec 64) (_ BitVec 64))) (aws_linked_list_insert_before_~to_add.offset (_ BitVec 64)) (v_arrayElimCell_17 (_ BitVec 64))) (= c_aws_linked_list_insert_before_~before.base (select (select (let ((.cse5 (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base (let ((.cse7 (store .cse4 aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.base))) (store .cse7 (bvadd (_ bv8 64) aws_linked_list_insert_before_~to_add.offset) (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base .cse7) c_aws_linked_list_insert_before_~before.base) .cse2)))))) (let ((.cse6 (select (select .cse5 c_aws_linked_list_insert_before_~before.base) .cse2))) (store (store .cse5 .cse6 v_ArrVal_559) c_aws_linked_list_insert_before_~before.base (store (select (store .cse5 .cse6 (store (select .cse5 .cse6) v_arrayElimCell_17 c_aws_linked_list_insert_before_~to_add.base)) c_aws_linked_list_insert_before_~before.base) .cse2 c_aws_linked_list_insert_before_~to_add.base)))) c_aws_linked_list_insert_before_~to_add.base) aws_linked_list_insert_before_~to_add.offset))) (forall ((v_arrayElimCell_18 (_ BitVec 64))) (or (not (= c_aws_linked_list_insert_before_~to_add.base (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base (let ((.cse8 (store .cse4 v_arrayElimCell_18 c_aws_linked_list_insert_before_~before.base))) (store .cse8 (bvadd (_ bv8 64) v_arrayElimCell_18) (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base .cse8) c_aws_linked_list_insert_before_~before.base) .cse2)))) c_aws_linked_list_insert_before_~before.base) .cse2))) (= v_arrayElimCell_18 c_aws_linked_list_insert_before_~before.offset))) (forall ((v_ArrVal_559 (Array (_ BitVec 64) (_ BitVec 64))) (aws_linked_list_insert_before_~to_add.offset (_ BitVec 64)) (v_arrayElimCell_17 (_ BitVec 64))) (or (= c_aws_linked_list_insert_before_~before.base (select (select (let ((.cse9 (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base (let ((.cse11 (store .cse4 aws_linked_list_insert_before_~to_add.offset c_aws_linked_list_insert_before_~before.base))) (store .cse11 (bvadd (_ bv8 64) aws_linked_list_insert_before_~to_add.offset) (select (select (store |c_#memory_$Pointer$.base| c_aws_linked_list_insert_before_~to_add.base .cse11) c_aws_linked_list_insert_before_~before.base) .cse2)))))) (let ((.cse10 (select (select .cse9 c_aws_linked_list_insert_before_~before.base) .cse2))) (store (store .cse9 .cse10 v_ArrVal_559) c_aws_linked_list_insert_before_~before.base (store (select (store .cse9 .cse10 (store (select .cse9 .cse10) v_arrayElimCell_17 c_aws_linked_list_insert_before_~to_add.base)) c_aws_linked_list_insert_before_~before.base) .cse2 c_aws_linked_list_insert_before_~to_add.base)))) c_aws_linked_list_insert_before_~to_add.base) aws_linked_list_insert_before_~to_add.offset)) (= .cse2 aws_linked_list_insert_before_~to_add.offset))))) is different from true [2023-11-23 08:53:50,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:53:50,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202074841] [2023-11-23 08:53:50,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202074841] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:50,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [97759958] [2023-11-23 08:53:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:50,625 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-11-23 08:53:50,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-11-23 08:53:50,626 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-11-23 08:53:50,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2023-11-23 08:53:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:51,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 59 conjunts are in the unsatisfiable core [2023-11-23 08:53:51,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:51,453 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 10 treesize of output 8 [2023-11-23 08:53:51,892 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-23 08:53:51,892 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 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-23 08:53:56,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:56,947 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-23 08:53:56,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 304 [2023-11-23 08:53:56,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:53:58,194 INFO L349 Elim1Store]: treesize reduction 120, result has 27.3 percent of original size [2023-11-23 08:53:58,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 127 treesize of output 141 [2023-11-23 08:53:58,225 INFO L349 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2023-11-23 08:53:58,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 160 [2023-11-23 08:53:58,290 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-23 08:53:58,291 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 61 treesize of output 55 [2023-11-23 08:53:58,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 249 treesize of output 144 [2023-11-23 08:53:58,336 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 135 treesize of output 117 [2023-11-23 08:53:58,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 155 treesize of output 137 [2023-11-23 08:53:58,368 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 121 treesize of output 107 [2023-11-23 08:53:58,641 INFO L349 Elim1Store]: treesize reduction 40, result has 44.4 percent of original size [2023-11-23 08:53:58,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 65 [2023-11-23 08:53:58,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:54:14,448 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 16 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-23 08:54:14,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:54:14,825 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 1368 treesize of output 1350 [2023-11-23 08:55:05,718 WARN L293 SmtUtils]: Spent 50.09s on a formula simplification. DAG size of input: 201 DAG size of output: 136 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-23 08:55:05,720 INFO L349 Elim1Store]: treesize reduction 1178, result has 36.3 percent of original size [2023-11-23 08:55:05,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 8 new quantified variables, introduced 22 case distinctions, treesize of input 1566 treesize of output 2369 [2023-11-23 08:55:06,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:06,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:06,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:06,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:06,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:06,766 INFO L224 Elim1Store]: Index analysis took 599 ms [2023-11-23 08:55:07,642 INFO L349 Elim1Store]: treesize reduction 411, result has 17.3 percent of original size [2023-11-23 08:55:07,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 724 treesize of output 1153 [2023-11-23 08:55:07,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:07,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:07,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:08,481 INFO L349 Elim1Store]: treesize reduction 504, result has 24.6 percent of original size [2023-11-23 08:55:08,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 1081 treesize of output 1722 [2023-11-23 08:55:08,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:09,371 INFO L349 Elim1Store]: treesize reduction 382, result has 30.0 percent of original size [2023-11-23 08:55:09,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 917 treesize of output 1357 [2023-11-23 08:55:09,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:09,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:09,904 INFO L349 Elim1Store]: treesize reduction 169, result has 42.5 percent of original size [2023-11-23 08:55:09,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 930 treesize of output 807 [2023-11-23 08:55:09,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:10,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:10,056 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 614 treesize of output 371 [2023-11-23 08:55:10,110 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:10,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:10,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 721 treesize of output 633 [2023-11-23 08:55:10,350 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 84 treesize of output 82 [2023-11-23 08:55:12,762 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:13,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:13,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 238 treesize of output 264 [2023-11-23 08:55:19,425 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:19,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-11-23 08:55:19,686 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:19,757 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-11-23 08:55:19,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 155 treesize of output 155 [2023-11-23 08:55:20,057 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:20,160 INFO L349 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2023-11-23 08:55:20,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-23 08:55:20,224 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:20,321 INFO L349 Elim1Store]: treesize reduction 5, result has 73.7 percent of original size [2023-11-23 08:55:20,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 54 [2023-11-23 08:55:20,381 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:20,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2023-11-23 08:55:20,858 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:20,979 INFO L349 Elim1Store]: treesize reduction 29, result has 38.3 percent of original size [2023-11-23 08:55:20,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 164 treesize of output 131 [2023-11-23 08:55:21,664 INFO L349 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2023-11-23 08:55:21,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 176 treesize of output 184 [2023-11-23 08:55:22,337 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:22,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 156 treesize of output 174 [2023-11-23 08:55:22,930 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:27,584 INFO L224 Elim1Store]: Index analysis took 4537 ms [2023-11-23 08:55:28,527 INFO L349 Elim1Store]: treesize reduction 716, result has 0.1 percent of original size [2023-11-23 08:55:28,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 726 treesize of output 1 [2023-11-23 08:55:35,783 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2023-11-23 08:55:35,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 582195 treesize of output 499106 [2023-11-23 08:55:35,887 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 3407 treesize of output 3183 [2023-11-23 08:55:36,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:36,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1870 treesize of output 1816 [2023-11-23 08:55:38,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:38,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 15 treesize of output 11 [2023-11-23 08:55:38,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:38,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 22 treesize of output 15 [2023-11-23 08:55:39,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:39,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 7 treesize of output 6 [2023-11-23 08:55:39,163 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:39,163 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 1 case distinctions, treesize of input 15 treesize of output 11 [2023-11-23 08:55:42,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:42,087 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 11 treesize of output 15 [2023-11-23 08:55:42,124 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:55:42,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-23 08:55:42,152 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:42,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:42,179 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 11 treesize of output 15 [2023-11-23 08:55:42,206 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:55:42,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:42,251 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 33 treesize of output 37 [2023-11-23 08:55:42,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:55:42,320 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 1461 treesize of output 1385 [2023-11-23 08:55:42,398 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:42,404 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 22 [2023-11-23 08:55:42,448 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:42,472 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:42,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,506 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:42,542 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:42,547 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 11 treesize of output 9 [2023-11-23 08:55:42,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,633 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:42,637 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 270 treesize of output 262 [2023-11-23 08:55:42,685 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 08:55:42,686 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 133 treesize of output 123 [2023-11-23 08:55:42,721 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:42,743 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-23 08:55:42,743 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 277 treesize of output 271 [2023-11-23 08:55:42,806 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:55:42,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:42,820 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:42,822 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:55:42,834 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:55:42,873 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 08:55:42,874 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 1461 treesize of output 1 [2023-11-23 08:55:42,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,891 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 15 treesize of output 13 [2023-11-23 08:55:42,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,912 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 11 treesize of output 9 [2023-11-23 08:55:42,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,928 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 11 treesize of output 9 [2023-11-23 08:55:42,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:55:42,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:43,011 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:43,016 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 11 treesize of output 9 [2023-11-23 08:55:43,073 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 08:55:43,073 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 10626 treesize of output 1 [2023-11-23 08:55:43,093 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:55:43,102 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:43,102 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:43,104 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:55:43,140 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-23 08:55:43,140 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 1611 treesize of output 1 [2023-11-23 08:55:43,159 INFO L349 Elim1Store]: treesize reduction 101, result has 1.0 percent of original size [2023-11-23 08:55:43,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 115 treesize of output 1 [2023-11-23 08:55:43,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:43,210 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:55:43,211 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-23 08:55:44,263 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 08:55:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [97759958] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:55:44,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:55:44,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [22, 18] total 46 [2023-11-23 08:55:44,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094481079] [2023-11-23 08:55:44,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:55:44,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 08:55:44,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-23 08:55:44,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 08:55:44,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1911, Unknown=10, NotChecked=88, Total=2162 [2023-11-23 08:55:44,265 INFO L87 Difference]: Start difference. First operand 108 states and 145 transitions. Second operand has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-23 08:55:54,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:56:00,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-23 08:56:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:56:03,090 INFO L93 Difference]: Finished difference Result 143 states and 200 transitions. [2023-11-23 08:56:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-23 08:56:03,090 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 83 [2023-11-23 08:56:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:56:03,091 INFO L225 Difference]: With dead ends: 143 [2023-11-23 08:56:03,091 INFO L226 Difference]: Without dead ends: 141 [2023-11-23 08:56:03,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 191 SyntacticMatches, 23 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 33.8s TimeCoverageRelationStatistics Valid=179, Invalid=2467, Unknown=10, NotChecked=100, Total=2756 [2023-11-23 08:56:03,093 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 23 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1041 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2023-11-23 08:56:03,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1041 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 16.4s Time] [2023-11-23 08:56:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-23 08:56:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2023-11-23 08:56:03,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 87 states have internal predecessors, (100), 44 states have call successors, (44), 10 states have call predecessors, (44), 12 states have return successors, (53), 42 states have call predecessors, (53), 43 states have call successors, (53) [2023-11-23 08:56:03,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 197 transitions. [2023-11-23 08:56:03,104 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 197 transitions. Word has length 83 [2023-11-23 08:56:03,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:56:03,104 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 197 transitions. [2023-11-23 08:56:03,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 4.363636363636363) internal successors, (48), 11 states have internal predecessors, (48), 6 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2023-11-23 08:56:03,104 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 197 transitions. [2023-11-23 08:56:03,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-23 08:56:03,105 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:56:03,105 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:56:03,113 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2023-11-23 08:56:03,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-23 08:56:03,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:56:03,511 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:56:03,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:56:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1621584964, now seen corresponding path program 1 times [2023-11-23 08:56:03,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-23 08:56:03,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319338063] [2023-11-23 08:56:03,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:56:03,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:56:03,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-11-23 08:56:03,513 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-23 08:56:03,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-23 08:56:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:56:03,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-23 08:56:03,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:56:04,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:04,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 96 [2023-11-23 08:56:04,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:04,463 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 38 treesize of output 34 [2023-11-23 08:56:04,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 29 [2023-11-23 08:56:04,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:04,810 INFO L349 Elim1Store]: treesize reduction 83, result has 1.2 percent of original size [2023-11-23 08:56:04,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 111 [2023-11-23 08:56:05,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 29 [2023-11-23 08:56:05,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 08:56:05,447 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 38 treesize of output 34 [2023-11-23 08:56:05,683 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 116 treesize of output 94 [2023-11-23 08:56:06,033 INFO L349 Elim1Store]: treesize reduction 62, result has 12.7 percent of original size [2023-11-23 08:56:06,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 401 treesize of output 417 [2023-11-23 08:56:06,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 108 [2023-11-23 08:56:06,080 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 309 treesize of output 301 [2023-11-23 08:56:06,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 27 treesize of output 28 [2023-11-23 08:56:06,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 25 [2023-11-23 08:56:06,538 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 5 treesize of output 3 [2023-11-23 08:56:06,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 103 [2023-11-23 08:56:07,204 INFO L349 Elim1Store]: treesize reduction 62, result has 12.7 percent of original size [2023-11-23 08:56:07,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 401 treesize of output 417 [2023-11-23 08:56:07,246 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:09,557 INFO L349 Elim1Store]: treesize reduction 121, result has 30.1 percent of original size [2023-11-23 08:56:09,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 142 treesize of output 247 [2023-11-23 08:56:09,587 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 89 treesize of output 77 [2023-11-23 08:56:09,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 342 treesize of output 312 [2023-11-23 08:56:09,651 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 1213 treesize of output 1169 [2023-11-23 08:56:09,986 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:11,441 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:11,441 INFO L224 Elim1Store]: Index analysis took 1702 ms [2023-11-23 08:56:11,449 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:13,715 INFO L349 Elim1Store]: treesize reduction 217, result has 13.2 percent of original size [2023-11-23 08:56:13,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 249 treesize of output 379 [2023-11-23 08:56:17,706 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:18,390 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:21,442 INFO L224 Elim1Store]: Index analysis took 3739 ms [2023-11-23 08:56:21,445 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:21,447 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-23 08:56:21,606 INFO L349 Elim1Store]: treesize reduction 71, result has 1.4 percent of original size [2023-11-23 08:56:21,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 113 [2023-11-23 08:56:37,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 201 treesize of output 197 [2023-11-23 08:56:37,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 127 [2023-11-23 08:56:37,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 121 [2023-11-23 08:56:38,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 191 [2023-11-23 08:56:38,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 123 [2023-11-23 08:56:38,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 115 [2023-11-23 08:56:38,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 143 [2023-11-23 08:56:39,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 190 [2023-11-23 08:56:39,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 190 [2023-11-23 08:56:40,644 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 08:56:40,647 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 08:56:40,652 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-23 08:56:42,996 INFO L349 Elim1Store]: treesize reduction 104, result has 9.6 percent of original size [2023-11-23 08:56:42,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 243 treesize of output 241 [2023-11-23 08:56:45,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-23 08:56:45,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319338063] [2023-11-23 08:56:45,080 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-23 08:56:45,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-23 08:56:45,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-23 08:56:45,281 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-23 08:56:45,285 INFO L158 Benchmark]: Toolchain (without parser) took 200866.46ms. Allocated memory was 69.2MB in the beginning and 213.9MB in the end (delta: 144.7MB). Free memory was 34.4MB in the beginning and 156.2MB in the end (delta: -121.8MB). Peak memory consumption was 146.6MB. Max. memory is 16.1GB. [2023-11-23 08:56:45,285 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 30.0MB in the beginning and 30.0MB in the end (delta: 47.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:56:45,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1732.56ms. Allocated memory was 69.2MB in the beginning and 119.5MB in the end (delta: 50.3MB). Free memory was 34.2MB in the beginning and 59.7MB in the end (delta: -25.5MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. [2023-11-23 08:56:45,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 92.64ms. Allocated memory is still 119.5MB. Free memory was 59.7MB in the beginning and 53.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 08:56:45,286 INFO L158 Benchmark]: Boogie Preprocessor took 36.85ms. Allocated memory is still 119.5MB. Free memory was 53.4MB in the beginning and 49.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:56:45,286 INFO L158 Benchmark]: RCFGBuilder took 768.77ms. Allocated memory is still 119.5MB. Free memory was 49.9MB in the beginning and 45.0MB in the end (delta: 4.8MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2023-11-23 08:56:45,286 INFO L158 Benchmark]: TraceAbstraction took 198230.13ms. Allocated memory was 119.5MB in the beginning and 213.9MB in the end (delta: 94.4MB). Free memory was 44.2MB in the beginning and 156.2MB in the end (delta: -112.0MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. [2023-11-23 08:56:45,287 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 30.0MB in the beginning and 30.0MB in the end (delta: 47.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1732.56ms. Allocated memory was 69.2MB in the beginning and 119.5MB in the end (delta: 50.3MB). Free memory was 34.2MB in the beginning and 59.7MB in the end (delta: -25.5MB). Peak memory consumption was 38.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 92.64ms. Allocated memory is still 119.5MB. Free memory was 59.7MB in the beginning and 53.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.85ms. Allocated memory is still 119.5MB. Free memory was 53.4MB in the beginning and 49.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 768.77ms. Allocated memory is still 119.5MB. Free memory was 49.9MB in the beginning and 45.0MB in the end (delta: 4.8MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 198230.13ms. Allocated memory was 119.5MB in the beginning and 213.9MB in the end (delta: 94.4MB). Free memory was 44.2MB in the beginning and 156.2MB in the end (delta: -112.0MB). Peak memory consumption was 106.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-23 08:56:45,451 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: no need to replace index