./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_next_harness.i --full-output --preprocessor.use.memory.slicer true --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_next_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 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e --preprocessor.use.memory.slicer true --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 07:27:55,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 07:27:55,177 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 07:27:55,182 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 07:27:55,182 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 07:27:55,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 07:27:55,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 07:27:55,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 07:27:55,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 07:27:55,239 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 07:27:55,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 07:27:55,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 07:27:55,241 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 07:27:55,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 07:27:55,242 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 07:27:55,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 07:27:55,243 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 07:27:55,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 07:27:55,243 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 07:27:55,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 07:27:55,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 07:27:55,245 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 07:27:55,245 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 07:27:55,246 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 07:27:55,248 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 07:27:55,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 07:27:55,250 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 07:27:55,250 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 07:27:55,251 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:27:55,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 07:27:55,255 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 07:27:55,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 07:27:55,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 07:27:55,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 07:27:55,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 07:27:55,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 07:27:55,258 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 07:27:55,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 07:27:55,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 07:27:55,260 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 -> 5bb1e95e9d6379d31cbb3e207d6fe85ddf495edebf9b764e927537f63dbf829e Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> true [2023-11-23 07:27:55,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 07:27:55,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 07:27:55,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 07:27:55,608 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 07:27:55,609 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 07:27:55,610 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_next_harness.i [2023-11-23 07:27:57,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 07:27:57,476 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 07:27:57,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_next_harness.i [2023-11-23 07:27:57,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d254769/349c20c9a06e4f7d8769a5d9bd0f484c/FLAG63c3cde67 [2023-11-23 07:27:57,531 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2d254769/349c20c9a06e4f7d8769a5d9bd0f484c [2023-11-23 07:27:57,534 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 07:27:57,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 07:27:57,537 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 07:27:57,538 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 07:27:57,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 07:27:57,542 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:27:57" (1/1) ... [2023-11-23 07:27:57,543 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0978bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:57, skipping insertion in model container [2023-11-23 07:27:57,543 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:27:57" (1/1) ... [2023-11-23 07:27:57,644 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 07:27:57,915 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_next_harness.i[4494,4507] [2023-11-23 07:27:57,923 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_next_harness.i[4554,4567] [2023-11-23 07:27:58,467 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,468 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,468 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,469 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,470 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,481 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,487 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,489 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,489 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,491 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,492 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,492 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,493 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,709 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:27:58,710 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:27:58,711 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:27:58,712 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:27:58,713 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:27:58,713 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:27:58,714 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:27:58,714 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:27:58,715 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:27:58,715 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:27:58,853 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:27:58,869 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 07:27:58,887 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_next_harness.i[4494,4507] [2023-11-23 07:27:58,888 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_next_harness.i[4554,4567] [2023-11-23 07:27:58,927 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,927 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,928 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,928 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,929 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,937 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,938 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,939 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,939 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,940 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,940 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,941 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,941 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 07:27:58,982 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 07:27:58,988 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 07:27:58,989 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 07:27:58,989 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 07:27:58,992 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 07:27:58,993 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 07:27:58,993 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 07:27:58,993 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 07:27:58,994 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 07:27:58,994 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 07:27:59,026 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 07:27:59,254 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,255 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,255 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,255 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,255 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,256 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,256 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,257 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,257 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,257 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,257 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,258 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,258 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,259 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,259 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 07:27:59,266 INFO L206 MainTranslator]: Completed translation [2023-11-23 07:27:59,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59 WrapperNode [2023-11-23 07:27:59,269 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 07:27:59,270 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 07:27:59,270 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 07:27:59,270 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 07:27:59,277 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,419 INFO L138 Inliner]: procedures = 678, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 56 [2023-11-23 07:27:59,420 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 07:27:59,420 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 07:27:59,421 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 07:27:59,421 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 07:27:59,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,472 INFO L188 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 4, 6]. 35 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 2 writes are split as follows [0, 0, 1, 1]. [2023-11-23 07:27:59,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,501 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 07:27:59,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 07:27:59,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 07:27:59,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 07:27:59,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (1/1) ... [2023-11-23 07:27:59,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 07:27:59,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:27:59,551 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 07:27:59,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 07:27:59,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 07:27:59,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 07:27:59,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 07:27:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:27:59,602 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 07:27:59,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 07:27:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-23 07:27:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-23 07:27:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-23 07:27:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-23 07:27:59,603 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 07:27:59,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 07:27:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 07:27:59,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 07:27:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 07:27:59,604 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-23 07:27:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-23 07:27:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-23 07:27:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-23 07:27:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-23 07:27:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-23 07:27:59,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-23 07:27:59,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-23 07:27:59,606 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:27:59,606 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:27:59,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 07:27:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-23 07:27:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-23 07:27:59,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-23 07:27:59,874 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 07:27:59,876 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 07:28:00,027 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 07:28:00,073 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 07:28:00,073 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 07:28:00,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:28:00 BoogieIcfgContainer [2023-11-23 07:28:00,074 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 07:28:00,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 07:28:00,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 07:28:00,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 07:28:00,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:27:57" (1/3) ... [2023-11-23 07:28:00,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618b318b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:28:00, skipping insertion in model container [2023-11-23 07:28:00,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:27:59" (2/3) ... [2023-11-23 07:28:00,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@618b318b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:28:00, skipping insertion in model container [2023-11-23 07:28:00,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:28:00" (3/3) ... [2023-11-23 07:28:00,086 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_next_harness.i [2023-11-23 07:28:00,103 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 07:28:00,103 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 07:28:00,156 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 07:28:00,163 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;@1f8455ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 07:28:00,163 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 07:28:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-23 07:28:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:28:00,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:00,176 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:00,176 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:00,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash -178940107, now seen corresponding path program 1 times [2023-11-23 07:28:00,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:00,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480208381] [2023-11-23 07:28:00,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:00,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:00,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:00,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:00,636 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 07:28:00,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:00,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480208381] [2023-11-23 07:28:00,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480208381] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:00,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:00,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 07:28:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312645661] [2023-11-23 07:28:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:00,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 07:28:00,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:00,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 07:28:00,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:28:00,675 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 07:28:00,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:00,718 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2023-11-23 07:28:00,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 07:28:00,720 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2023-11-23 07:28:00,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:00,728 INFO L225 Difference]: With dead ends: 81 [2023-11-23 07:28:00,730 INFO L226 Difference]: Without dead ends: 41 [2023-11-23 07:28:00,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 07:28:00,738 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:00,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:28:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-23 07:28:00,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-23 07:28:00,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 07:28:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2023-11-23 07:28:00,780 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 25 [2023-11-23 07:28:00,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:00,787 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-23 07:28:00,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-23 07:28:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2023-11-23 07:28:00,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:28:00,790 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:00,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:00,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 07:28:00,791 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:00,793 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:00,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1458803785, now seen corresponding path program 1 times [2023-11-23 07:28:00,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:00,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472567416] [2023-11-23 07:28:00,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:00,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:01,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:01,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:28:01,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:01,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472567416] [2023-11-23 07:28:01,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472567416] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:01,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:01,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 07:28:01,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986018931] [2023-11-23 07:28:01,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:01,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:28:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:01,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:28:01,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:28:01,916 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 07:28:02,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:02,185 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2023-11-23 07:28:02,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:28:02,186 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-23 07:28:02,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:02,189 INFO L225 Difference]: With dead ends: 51 [2023-11-23 07:28:02,190 INFO L226 Difference]: Without dead ends: 49 [2023-11-23 07:28:02,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:28:02,192 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 13 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:02,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 245 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:28:02,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-23 07:28:02,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2023-11-23 07:28:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 07:28:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-11-23 07:28:02,212 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 25 [2023-11-23 07:28:02,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:02,214 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-11-23 07:28:02,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 07:28:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-11-23 07:28:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:28:02,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:02,217 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:02,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 07:28:02,218 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:02,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:02,218 INFO L85 PathProgramCache]: Analyzing trace with hash 316203577, now seen corresponding path program 1 times [2023-11-23 07:28:02,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:02,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476957719] [2023-11-23 07:28:02,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:02,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:02,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:02,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:02,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:02,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:28:02,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:02,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476957719] [2023-11-23 07:28:02,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476957719] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:02,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:02,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 07:28:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464488920] [2023-11-23 07:28:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:02,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:28:02,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:02,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:28:02,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:28:02,540 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 07:28:02,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:02,673 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2023-11-23 07:28:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:28:02,674 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-23 07:28:02,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:02,675 INFO L225 Difference]: With dead ends: 99 [2023-11-23 07:28:02,675 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 07:28:02,676 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:28:02,677 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:02,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 146 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 07:28:02,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-11-23 07:28:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-23 07:28:02,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-11-23 07:28:02,697 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 25 [2023-11-23 07:28:02,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:02,697 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-11-23 07:28:02,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 07:28:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-11-23 07:28:02,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 07:28:02,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:02,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:02,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 07:28:02,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:02,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash 996261947, now seen corresponding path program 1 times [2023-11-23 07:28:02,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:02,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785921533] [2023-11-23 07:28:02,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:02,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:02,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:02,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:03,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:28:03,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785921533] [2023-11-23 07:28:03,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785921533] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502719818] [2023-11-23 07:28:03,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:03,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:03,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:03,067 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:03,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 07:28:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:03,197 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-23 07:28:03,201 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:03,310 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:28:03,310 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:03,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502719818] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:03,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:28:03,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-11-23 07:28:03,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973879607] [2023-11-23 07:28:03,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:03,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 07:28:03,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:03,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 07:28:03,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:28:03,312 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 07:28:03,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:03,347 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2023-11-23 07:28:03,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:28:03,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-11-23 07:28:03,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:03,349 INFO L225 Difference]: With dead ends: 103 [2023-11-23 07:28:03,349 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 07:28:03,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:28:03,361 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:03,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:28:03,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 07:28:03,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-11-23 07:28:03,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 07:28:03,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-11-23 07:28:03,392 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 25 [2023-11-23 07:28:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:03,392 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-11-23 07:28:03,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-23 07:28:03,393 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-11-23 07:28:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 07:28:03,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:03,394 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:03,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:03,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:03,609 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:03,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:03,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1070928168, now seen corresponding path program 1 times [2023-11-23 07:28:03,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:03,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100071762] [2023-11-23 07:28:03,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:03,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:04,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:04,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:04,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:04,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 07:28:04,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:04,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100071762] [2023-11-23 07:28:04,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100071762] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:04,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:04,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 07:28:04,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452940367] [2023-11-23 07:28:04,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:04,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 07:28:04,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:04,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 07:28:04,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-23 07:28:04,478 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 07:28:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:04,720 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2023-11-23 07:28:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 07:28:04,720 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2023-11-23 07:28:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:04,722 INFO L225 Difference]: With dead ends: 59 [2023-11-23 07:28:04,722 INFO L226 Difference]: Without dead ends: 57 [2023-11-23 07:28:04,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-11-23 07:28:04,723 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:04,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 324 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:28:04,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-23 07:28:04,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2023-11-23 07:28:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.1764705882352942) internal successors, (40), 37 states have internal predecessors, (40), 13 states have call successors, (13), 6 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 07:28:04,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2023-11-23 07:28:04,731 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 38 [2023-11-23 07:28:04,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:04,731 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2023-11-23 07:28:04,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2023-11-23 07:28:04,732 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2023-11-23 07:28:04,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 07:28:04,733 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:04,733 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:04,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 07:28:04,733 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:04,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:04,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1449031766, now seen corresponding path program 1 times [2023-11-23 07:28:04,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:04,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143831033] [2023-11-23 07:28:04,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:04,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:05,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:05,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:05,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:05,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:05,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:05,222 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 07:28:05,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143831033] [2023-11-23 07:28:05,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143831033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:05,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747209737] [2023-11-23 07:28:05,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:05,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:05,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:05,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:05,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 07:28:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:05,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-23 07:28:05,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:05,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 07:28:05,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 07:28:05,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-11-23 07:28:06,088 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 25 treesize of output 17 [2023-11-23 07:28:07,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:07,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 30 [2023-11-23 07:28:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 07:28:22,167 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:28:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 07:28:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747209737] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:22,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:28:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11, 14] total 30 [2023-11-23 07:28:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235095032] [2023-11-23 07:28:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:22,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:28:22,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:22,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:28:22,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=744, Unknown=5, NotChecked=0, Total=870 [2023-11-23 07:28:22,448 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 07:28:22,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:22,710 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2023-11-23 07:28:22,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 07:28:22,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-23 07:28:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:22,713 INFO L225 Difference]: With dead ends: 96 [2023-11-23 07:28:22,715 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 07:28:22,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=143, Invalid=908, Unknown=5, NotChecked=0, Total=1056 [2023-11-23 07:28:22,718 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:22,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 185 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:28:22,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 07:28:22,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2023-11-23 07:28:22,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 41 states have internal predecessors, (44), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-23 07:28:22,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2023-11-23 07:28:22,734 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 38 [2023-11-23 07:28:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:22,734 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2023-11-23 07:28:22,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 07:28:22,735 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2023-11-23 07:28:22,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 07:28:22,740 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:22,740 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:22,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 07:28:22,956 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,SelfDestructingSolverStorable5 [2023-11-23 07:28:22,956 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:22,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:22,957 INFO L85 PathProgramCache]: Analyzing trace with hash -768973396, now seen corresponding path program 1 times [2023-11-23 07:28:22,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:22,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662685948] [2023-11-23 07:28:22,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:22,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:23,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 07:28:23,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:23,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662685948] [2023-11-23 07:28:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662685948] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:23,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:23,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:28:23,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865604778] [2023-11-23 07:28:23,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:23,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:28:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:28:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:28:23,153 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 07:28:23,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:23,220 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2023-11-23 07:28:23,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:28:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2023-11-23 07:28:23,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:23,223 INFO L225 Difference]: With dead ends: 105 [2023-11-23 07:28:23,223 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 07:28:23,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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 07:28:23,225 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:23,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 156 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:23,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 07:28:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2023-11-23 07:28:23,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 39 states have internal predecessors, (43), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-23 07:28:23,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2023-11-23 07:28:23,233 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 38 [2023-11-23 07:28:23,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:23,234 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2023-11-23 07:28:23,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-23 07:28:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2023-11-23 07:28:23,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 07:28:23,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:23,235 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:23,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 07:28:23,236 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:23,236 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:23,236 INFO L85 PathProgramCache]: Analyzing trace with hash 512667469, now seen corresponding path program 1 times [2023-11-23 07:28:23,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:23,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849565838] [2023-11-23 07:28:23,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:23,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:23,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:23,460 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 07:28:23,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:23,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849565838] [2023-11-23 07:28:23,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849565838] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:23,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:23,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 07:28:23,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908742363] [2023-11-23 07:28:23,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:23,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 07:28:23,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:23,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 07:28:23,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 07:28:23,464 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 07:28:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:23,553 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2023-11-23 07:28:23,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 07:28:23,554 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2023-11-23 07:28:23,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:23,555 INFO L225 Difference]: With dead ends: 63 [2023-11-23 07:28:23,555 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 07:28:23,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:28:23,557 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:23,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 204 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 07:28:23,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-23 07:28:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 42 states have internal predecessors, (46), 12 states have call successors, (12), 7 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-23 07:28:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2023-11-23 07:28:23,571 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 71 transitions. Word has length 44 [2023-11-23 07:28:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:23,572 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 71 transitions. [2023-11-23 07:28:23,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-23 07:28:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2023-11-23 07:28:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 07:28:23,574 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:23,574 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:23,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 07:28:23,575 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:23,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:23,575 INFO L85 PathProgramCache]: Analyzing trace with hash 630580646, now seen corresponding path program 1 times [2023-11-23 07:28:23,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540772073] [2023-11-23 07:28:23,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:23,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:24,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:24,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:28:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 07:28:24,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:24,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540772073] [2023-11-23 07:28:24,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540772073] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:24,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:24,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-23 07:28:24,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769483527] [2023-11-23 07:28:24,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:24,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:28:24,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:24,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:28:24,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:28:24,389 INFO L87 Difference]: Start difference. First operand 61 states and 71 transitions. Second operand has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:28:24,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:24,598 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2023-11-23 07:28:24,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:28:24,599 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-11-23 07:28:24,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:24,599 INFO L225 Difference]: With dead ends: 71 [2023-11-23 07:28:24,599 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 07:28:24,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-23 07:28:24,600 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:24,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 239 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:28:24,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 07:28:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-23 07:28:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 47 states have internal predecessors, (50), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 07:28:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2023-11-23 07:28:24,608 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 57 [2023-11-23 07:28:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:24,608 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2023-11-23 07:28:24,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:28:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2023-11-23 07:28:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 07:28:24,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:24,609 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:24,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 07:28:24,610 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:24,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:24,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1889379288, now seen corresponding path program 1 times [2023-11-23 07:28:24,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:24,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639809846] [2023-11-23 07:28:24,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:24,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:24,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:24,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:28:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 07:28:24,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:24,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639809846] [2023-11-23 07:28:24,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639809846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:24,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:24,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 07:28:24,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910026323] [2023-11-23 07:28:24,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:24,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 07:28:24,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 07:28:24,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-23 07:28:24,885 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:28:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:25,023 INFO L93 Difference]: Finished difference Result 92 states and 106 transitions. [2023-11-23 07:28:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:28:25,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-11-23 07:28:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:25,025 INFO L225 Difference]: With dead ends: 92 [2023-11-23 07:28:25,025 INFO L226 Difference]: Without dead ends: 68 [2023-11-23 07:28:25,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:28:25,026 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 14 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:25,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 122 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:25,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-23 07:28:25,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-23 07:28:25,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 47 states have internal predecessors, (49), 13 states have call successors, (13), 8 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 07:28:25,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2023-11-23 07:28:25,038 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 57 [2023-11-23 07:28:25,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:25,038 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2023-11-23 07:28:25,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:28:25,038 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2023-11-23 07:28:25,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 07:28:25,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:25,039 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:25,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 07:28:25,039 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:25,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:25,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1209320918, now seen corresponding path program 1 times [2023-11-23 07:28:25,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:25,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862845268] [2023-11-23 07:28:25,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:25,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:25,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:25,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:25,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:25,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:25,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:25,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:25,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:25,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:25,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:28:25,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:28:25,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862845268] [2023-11-23 07:28:25,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862845268] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:25,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858643755] [2023-11-23 07:28:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:25,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:25,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:25,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:25,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 07:28:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:25,760 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-23 07:28:25,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 07:28:25,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 07:28:25,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858643755] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:25,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 07:28:25,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2023-11-23 07:28:25,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839089716] [2023-11-23 07:28:25,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:25,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 07:28:25,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:25,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 07:28:25,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:28:25,836 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:28:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:25,864 INFO L93 Difference]: Finished difference Result 94 states and 106 transitions. [2023-11-23 07:28:25,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 07:28:25,865 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 57 [2023-11-23 07:28:25,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:25,868 INFO L225 Difference]: With dead ends: 94 [2023-11-23 07:28:25,868 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 07:28:25,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:28:25,869 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:25,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 120 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 07:28:25,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 07:28:25,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2023-11-23 07:28:25,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 07:28:25,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-11-23 07:28:25,877 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 57 [2023-11-23 07:28:25,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:25,878 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-23 07:28:25,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2023-11-23 07:28:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2023-11-23 07:28:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:28:25,879 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:25,879 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:25,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:26,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:26,096 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:26,096 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:26,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1272356003, now seen corresponding path program 1 times [2023-11-23 07:28:26,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:26,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678587054] [2023-11-23 07:28:26,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:26,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:26,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:26,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:28:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:28:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:28:26,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 07:28:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678587054] [2023-11-23 07:28:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678587054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:26,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:26,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-23 07:28:26,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935064596] [2023-11-23 07:28:26,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:26,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 07:28:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 07:28:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-11-23 07:28:26,978 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 07:28:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:27,258 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2023-11-23 07:28:27,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-23 07:28:27,258 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 70 [2023-11-23 07:28:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:27,259 INFO L225 Difference]: With dead ends: 71 [2023-11-23 07:28:27,259 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 07:28:27,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2023-11-23 07:28:27,260 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 13 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:27,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 281 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 07:28:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 07:28:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-23 07:28:27,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 46 states have internal predecessors, (47), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-23 07:28:27,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-11-23 07:28:27,267 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 70 [2023-11-23 07:28:27,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:27,267 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-11-23 07:28:27,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 07:28:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-11-23 07:28:27,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:28:27,268 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:27,268 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:27,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 07:28:27,268 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:27,268 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:27,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1247603931, now seen corresponding path program 1 times [2023-11-23 07:28:27,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:27,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365539038] [2023-11-23 07:28:27,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:27,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:27,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:27,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:27,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:28:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:28:27,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:28:27,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:27,923 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-23 07:28:27,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:27,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365539038] [2023-11-23 07:28:27,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365539038] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:27,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342591670] [2023-11-23 07:28:27,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:27,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:27,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 07:28:27,928 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 07:28:27,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 07:28:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:28,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 60 conjunts are in the unsatisfiable core [2023-11-23 07:28:28,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 07:28:28,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-23 07:28:28,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-23 07:28:28,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-23 07:28:28,381 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 7 treesize of output 3 [2023-11-23 07:28:29,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 07:28:29,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 26 [2023-11-23 07:28:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 11 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-11-23 07:28:29,442 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 07:28:29,722 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 07:28:29,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342591670] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 07:28:29,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 07:28:29,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13, 13] total 32 [2023-11-23 07:28:29,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77860121] [2023-11-23 07:28:29,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:29,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 07:28:29,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:29,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 07:28:29,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2023-11-23 07:28:29,724 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 07:28:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:29,940 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2023-11-23 07:28:29,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 07:28:29,940 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 70 [2023-11-23 07:28:29,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:29,941 INFO L225 Difference]: With dead ends: 79 [2023-11-23 07:28:29,941 INFO L226 Difference]: Without dead ends: 68 [2023-11-23 07:28:29,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 123 SyntacticMatches, 15 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2023-11-23 07:28:29,942 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:29,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 125 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:29,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-23 07:28:29,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-23 07:28:29,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.069767441860465) internal successors, (46), 46 states have internal predecessors, (46), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2023-11-23 07:28:29,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2023-11-23 07:28:29,947 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 70 [2023-11-23 07:28:29,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:29,947 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2023-11-23 07:28:29,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 07:28:29,947 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2023-11-23 07:28:29,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 07:28:29,947 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:29,947 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:29,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 07:28:30,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 07:28:30,148 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:30,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:30,149 INFO L85 PathProgramCache]: Analyzing trace with hash -567545561, now seen corresponding path program 1 times [2023-11-23 07:28:30,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:30,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943920764] [2023-11-23 07:28:30,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:30,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:28:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:28:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:28:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 07:28:30,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:30,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943920764] [2023-11-23 07:28:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943920764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:30,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 07:28:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441172220] [2023-11-23 07:28:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:30,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:28:30,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:30,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:28:30,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:28:30,464 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 07:28:30,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:30,538 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2023-11-23 07:28:30,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:28:30,539 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) Word has length 70 [2023-11-23 07:28:30,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:30,540 INFO L225 Difference]: With dead ends: 81 [2023-11-23 07:28:30,541 INFO L226 Difference]: Without dead ends: 59 [2023-11-23 07:28:30,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-23 07:28:30,541 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 6 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:30,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 256 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:30,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-23 07:28:30,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-23 07:28:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.0) internal successors, (38), 38 states have internal predecessors, (38), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 07:28:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2023-11-23 07:28:30,548 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 70 [2023-11-23 07:28:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:30,548 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2023-11-23 07:28:30,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 4 states have call successors, (10) [2023-11-23 07:28:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2023-11-23 07:28:30,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-23 07:28:30,553 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 07:28:30,553 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:30,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 07:28:30,553 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 07:28:30,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 07:28:30,553 INFO L85 PathProgramCache]: Analyzing trace with hash -465805442, now seen corresponding path program 1 times [2023-11-23 07:28:30,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 07:28:30,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795056231] [2023-11-23 07:28:30,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 07:28:30,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 07:28:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 07:28:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 07:28:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 07:28:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 07:28:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 07:28:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 07:28:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 07:28:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 07:28:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 07:28:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 07:28:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 07:28:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 07:28:30,956 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-23 07:28:30,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 07:28:30,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795056231] [2023-11-23 07:28:30,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795056231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 07:28:30,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 07:28:30,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-23 07:28:30,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247514552] [2023-11-23 07:28:30,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 07:28:30,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 07:28:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 07:28:30,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 07:28:30,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-23 07:28:30,959 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 07:28:31,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 07:28:31,085 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2023-11-23 07:28:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 07:28:31,086 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 76 [2023-11-23 07:28:31,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 07:28:31,088 INFO L225 Difference]: With dead ends: 59 [2023-11-23 07:28:31,088 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 07:28:31,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-23 07:28:31,090 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 5 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 07:28:31,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 212 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 07:28:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 07:28:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 07:28:31,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 07:28:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 07:28:31,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2023-11-23 07:28:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 07:28:31,091 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 07:28:31,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 7 states have internal predecessors, (26), 4 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2023-11-23 07:28:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 07:28:31,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 07:28:31,095 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 07:28:31,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 07:28:31,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 07:28:31,650 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2023-11-23 07:28:31,650 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2023-11-23 07:28:31,650 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2023-11-23 07:28:31,650 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2023-11-23 07:28:31,650 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2023-11-23 07:28:31,651 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4717 4721) the Hoare annotation is: true [2023-11-23 07:28:31,651 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2023-11-23 07:28:31,651 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2023-11-23 07:28:31,651 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2023-11-23 07:28:31,651 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2023-11-23 07:28:31,651 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2023-11-23 07:28:31,651 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4728 4732) the Hoare annotation is: true [2023-11-23 07:28:31,651 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 07:28:31,651 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 07:28:31,651 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 07:28:31,651 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 07:28:31,651 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2023-11-23 07:28:31,651 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 07:28:31,652 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 8))) (let ((.cse1 (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8)) (.cse3 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |#memory_$Pointer$#3.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$#3.offset| .cse2) .cse3)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset|) (<= 1 .cse2) (not (= .cse0 0))))) [2023-11-23 07:28:31,652 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2023-11-23 07:28:31,652 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 8))) (let ((.cse1 (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8)) (.cse3 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |#memory_$Pointer$#3.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$#3.offset| .cse2) .cse3)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset|) (<= 1 .cse2) (= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret680#1| 1) (not (= .cse0 0))))) [2023-11-23 07:28:31,652 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 8))) (let ((.cse1 (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8)) (.cse3 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |#memory_$Pointer$#3.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$#3.offset| .cse2) .cse3)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset|) (<= 1 .cse2) (not (= .cse0 0))))) [2023-11-23 07:28:31,653 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 07:28:31,653 INFO L895 garLoopResultBuilder]: At program point L4840-1(line 4840) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8))) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse1) (+ .cse0 8)) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_#t~ret339#1| 1) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= .cse1 0)))) [2023-11-23 07:28:31,653 INFO L899 garLoopResultBuilder]: For program point L4840-2(line 4840) no Hoare annotation was computed. [2023-11-23 07:28:31,653 INFO L895 garLoopResultBuilder]: At program point L4840(line 4840) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8))) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse1) (+ .cse0 8)) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= .cse1 0)))) [2023-11-23 07:28:31,654 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 8))) (let ((.cse1 (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8)) (.cse3 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |#memory_$Pointer$#3.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$#3.offset| .cse2) .cse3)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset|) (<= 1 .cse2) (not (= .cse0 0))))) [2023-11-23 07:28:31,654 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2023-11-23 07:28:31,654 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| 8))) (let ((.cse1 (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8)) (.cse3 (select (select |#memory_$Pointer$#2.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse2 (select (select |#memory_$Pointer$#2.base| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) .cse4)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|))) (and (<= 2 |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse0) .cse1) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| .cse0) .cse1)) (= (select (select |#memory_$Pointer$#3.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (not (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.base| 0)) (= |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset| (select (select |#memory_$Pointer$#3.offset| .cse2) .cse3)) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_harness_~rval~10#1.offset|) (<= 1 .cse2) (= |ULTIMATE.start_aws_linked_list_next_harness_#t~ret681#1| 1) (not (= .cse0 0))))) [2023-11-23 07:28:31,654 INFO L895 garLoopResultBuilder]: At program point L4839(line 4839) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8))) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse1) (+ .cse0 8)) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= .cse1 0)))) [2023-11-23 07:28:31,654 INFO L895 garLoopResultBuilder]: At program point L4839-1(line 4839) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8))) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_#t~ret338#1| 1) (= (select (select |#memory_$Pointer$#2.offset| .cse1) (+ .cse0 8)) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= .cse1 0)))) [2023-11-23 07:28:31,655 INFO L895 garLoopResultBuilder]: At program point L4841(line 4841) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse1 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_#t~mem340#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_#t~mem340#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8))) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse0) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= .cse1 |ULTIMATE.start_aws_linked_list_next_~rval~4#1.base|) (= (select (select |#memory_$Pointer$#2.offset| .cse1) (+ .cse0 8)) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| |ULTIMATE.start_aws_linked_list_next_~rval~4#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= .cse1 0)))) [2023-11-23 07:28:31,655 INFO L899 garLoopResultBuilder]: For program point L4841-1(line 4841) no Hoare annotation was computed. [2023-11-23 07:28:31,655 INFO L899 garLoopResultBuilder]: For program point L4837-2(line 4837) no Hoare annotation was computed. [2023-11-23 07:28:31,655 INFO L895 garLoopResultBuilder]: At program point L4837(line 4837) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8))) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse1) (= (select (select |#memory_$Pointer$#2.offset| .cse0) (+ .cse1 8)) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= .cse0 0)))) [2023-11-23 07:28:31,655 INFO L899 garLoopResultBuilder]: For program point L4839-2(line 4839) no Hoare annotation was computed. [2023-11-23 07:28:31,656 INFO L895 garLoopResultBuilder]: At program point L4837-1(line 4837) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|)) (.cse0 (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|))) (and (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset| |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (= .cse0 |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.base|) (= |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base| (select (select |#memory_$Pointer$#2.base| (select (select |#memory_$Pointer$#3.base| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|)) (+ (select (select |#memory_$Pointer$#3.offset| |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.base|) |ULTIMATE.start_aws_linked_list_next_harness_~#node~1#1.offset|) 8))) (= |ULTIMATE.start_aws_linked_list_next_harness_~#after~0#1.offset| .cse1) (= (select (select |#memory_$Pointer$#2.offset| .cse0) (+ .cse1 8)) |ULTIMATE.start_aws_linked_list_next_~node#1.offset|) (<= 2 |ULTIMATE.start_aws_linked_list_next_~node#1.base|) (not (= .cse0 0)))) [2023-11-23 07:28:31,656 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 07:28:31,656 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 07:28:31,656 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 07:28:31,656 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 07:28:31,656 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 07:28:31,657 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 07:28:31,660 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 07:28:31,662 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 07:28:31,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:28:31 BoogieIcfgContainer [2023-11-23 07:28:31,666 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 07:28:31,666 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 07:28:31,666 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 07:28:31,667 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 07:28:31,667 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:28:00" (3/4) ... [2023-11-23 07:28:31,669 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 07:28:31,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2023-11-23 07:28:31,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2023-11-23 07:28:31,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 07:28:31,672 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 07:28:31,676 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-23 07:28:31,676 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-23 07:28:31,677 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 07:28:31,677 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 07:28:31,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 07:28:31,773 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 07:28:31,773 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 07:28:31,774 INFO L158 Benchmark]: Toolchain (without parser) took 34238.64ms. Allocated memory was 151.0MB in the beginning and 494.9MB in the end (delta: 343.9MB). Free memory was 84.5MB in the beginning and 395.5MB in the end (delta: -311.1MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2023-11-23 07:28:31,775 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 07:28:31,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1731.61ms. Allocated memory was 151.0MB in the beginning and 239.1MB in the end (delta: 88.1MB). Free memory was 84.1MB in the beginning and 151.2MB in the end (delta: -67.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2023-11-23 07:28:31,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.90ms. Allocated memory is still 239.1MB. Free memory was 150.3MB in the beginning and 145.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 07:28:31,776 INFO L158 Benchmark]: Boogie Preprocessor took 85.52ms. Allocated memory is still 239.1MB. Free memory was 145.1MB in the beginning and 141.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 07:28:31,776 INFO L158 Benchmark]: RCFGBuilder took 567.57ms. Allocated memory is still 239.1MB. Free memory was 141.9MB in the beginning and 118.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 07:28:31,776 INFO L158 Benchmark]: TraceAbstraction took 31589.37ms. Allocated memory was 239.1MB in the beginning and 494.9MB in the end (delta: 255.9MB). Free memory was 117.8MB in the beginning and 400.8MB in the end (delta: -283.0MB). Peak memory consumption was 172.5MB. Max. memory is 16.1GB. [2023-11-23 07:28:31,778 INFO L158 Benchmark]: Witness Printer took 107.01ms. Allocated memory is still 494.9MB. Free memory was 400.8MB in the beginning and 395.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 07:28:31,785 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.19ms. Allocated memory is still 100.7MB. Free memory is still 53.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1731.61ms. Allocated memory was 151.0MB in the beginning and 239.1MB in the end (delta: 88.1MB). Free memory was 84.1MB in the beginning and 151.2MB in the end (delta: -67.1MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.90ms. Allocated memory is still 239.1MB. Free memory was 150.3MB in the beginning and 145.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.52ms. Allocated memory is still 239.1MB. Free memory was 145.1MB in the beginning and 141.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 567.57ms. Allocated memory is still 239.1MB. Free memory was 141.9MB in the beginning and 118.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 31589.37ms. Allocated memory was 239.1MB in the beginning and 494.9MB in the end (delta: 255.9MB). Free memory was 117.8MB in the beginning and 400.8MB in the end (delta: -283.0MB). Peak memory consumption was 172.5MB. Max. memory is 16.1GB. * Witness Printer took 107.01ms. Allocated memory is still 494.9MB. Free memory was 400.8MB in the beginning and 395.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.5s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 184 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 141 mSDsluCounter, 2789 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2150 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1647 IncrementalHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 639 mSDtfsCounter, 1647 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 623 GetRequests, 430 SyntacticMatches, 18 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 18.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=9, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 14 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 87 PreInvPairs, 98 NumberOfFragments, 1029 HoareAnnotationTreeSize, 87 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 659 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 26.1s InterpolantComputationTime, 905 NumberOfCodeBlocks, 905 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 992 ConstructedInterpolants, 79 QuantifiedInterpolants, 7461 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1042 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 516/582 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-23 07:28:31,834 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE