./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/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 ../sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_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.graphml --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 fab5c58d108ab0116c19af669265df6088034967e28562e9e7d2713e6ada683d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:52:25,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:52:25,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:52:25,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:52:25,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:52:25,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:52:25,718 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:52:25,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:52:25,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:52:25,724 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:52:25,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:52:25,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:52:25,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:52:25,727 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:52:25,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:52:25,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:52:25,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:52:25,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:52:25,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:52:25,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:52:25,739 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:52:25,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:52:25,740 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:52:25,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:52:25,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:52:25,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:52:25,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:52:25,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:52:25,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:52:25,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:52:25,749 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:52:25,749 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:52:25,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:52:25,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:52:25,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:52:25,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:52:25,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:52:25,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:52:25,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:52:25,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:52:25,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:52:25,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:52:25,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-13 22:52:25,777 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:52:25,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:52:25,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:52:25,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:52:25,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:52:25,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:52:25,779 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:52:25,779 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:52:25,779 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:52:25,780 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:52:25,780 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 22:52:25,780 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:52:25,780 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:52:25,781 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:52:25,781 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:52:25,781 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:52:25,781 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:52:25,781 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:52:25,781 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:52:25,782 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:52:25,782 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:52:25,782 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:52:25,782 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:52:25,783 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:52:25,783 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:52:25,783 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 22:52:25,783 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 22:52:25,783 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:52:25,783 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:52:25,784 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:52:25,784 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> fab5c58d108ab0116c19af669265df6088034967e28562e9e7d2713e6ada683d [2022-07-13 22:52:25,975 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:52:25,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:52:25,992 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:52:25,993 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:52:25,993 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:52:25,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i [2022-07-13 22:52:26,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70c81446/c9412781b7a64a7ebb3bc9e456d6ff8d/FLAGa912c9300 [2022-07-13 22:52:26,591 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:52:26,591 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i [2022-07-13 22:52:26,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70c81446/c9412781b7a64a7ebb3bc9e456d6ff8d/FLAGa912c9300 [2022-07-13 22:52:27,083 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b70c81446/c9412781b7a64a7ebb3bc9e456d6ff8d [2022-07-13 22:52:27,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:52:27,085 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:52:27,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:52:27,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:52:27,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:52:27,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:52:27" (1/1) ... [2022-07-13 22:52:27,091 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d58797 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:27, skipping insertion in model container [2022-07-13 22:52:27,091 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:52:27" (1/1) ... [2022-07-13 22:52:27,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:52:27,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:52:27,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i[4503,4516] [2022-07-13 22:52:27,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i[4563,4576] [2022-07-13 22:52:27,808 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,808 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,809 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,810 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,811 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,824 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,825 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,828 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,829 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,831 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,833 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,834 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,834 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:27,990 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:52:27,991 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:52:27,991 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:52:27,992 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:52:27,993 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:52:27,993 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:52:27,993 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:52:27,994 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:52:27,994 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:52:27,995 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:52:28,060 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:52:28,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:52:28,082 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 22:52:28,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i[4503,4516] [2022-07-13 22:52:28,091 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i[4563,4576] [2022-07-13 22:52:28,116 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,116 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,117 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,117 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,118 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,123 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,123 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,124 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,124 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,125 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,125 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,126 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,126 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:52:28,148 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:52:28,149 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:52:28,149 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:52:28,150 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:52:28,150 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:52:28,151 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:52:28,151 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:52:28,151 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:52:28,152 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:52:28,152 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:52:28,166 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:52:28,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 22:52:28,303 INFO L208 MainTranslator]: Completed translation [2022-07-13 22:52:28,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28 WrapperNode [2022-07-13 22:52:28,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 22:52:28,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 22:52:28,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 22:52:28,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 22:52:28,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (1/1) ... [2022-07-13 22:52:28,372 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (1/1) ... [2022-07-13 22:52:28,450 INFO L137 Inliner]: procedures = 679, calls = 1080, calls flagged for inlining = 51, calls inlined = 5, statements flattened = 214 [2022-07-13 22:52:28,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 22:52:28,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 22:52:28,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 22:52:28,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 22:52:28,459 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (1/1) ... [2022-07-13 22:52:28,459 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (1/1) ... [2022-07-13 22:52:28,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (1/1) ... [2022-07-13 22:52:28,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (1/1) ... [2022-07-13 22:52:28,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (1/1) ... [2022-07-13 22:52:28,493 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (1/1) ... [2022-07-13 22:52:28,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (1/1) ... [2022-07-13 22:52:28,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 22:52:28,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 22:52:28,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 22:52:28,507 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 22:52:28,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (1/1) ... [2022-07-13 22:52:28,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:52:28,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:28,528 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) [2022-07-13 22:52:28,553 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 [2022-07-13 22:52:28,569 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2022-07-13 22:52:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2022-07-13 22:52:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 22:52:28,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 22:52:28,570 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 22:52:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-07-13 22:52:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-07-13 22:52:28,571 INFO L130 BoogieDeclarations]: Found specification of procedure ensure_linked_list_is_allocated [2022-07-13 22:52:28,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ensure_linked_list_is_allocated [2022-07-13 22:52:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 22:52:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-07-13 22:52:28,572 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-07-13 22:52:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 22:52:28,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 22:52:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 22:52:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 22:52:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-07-13 22:52:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-07-13 22:52:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 22:52:28,573 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 22:52:28,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 22:52:28,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 22:52:28,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-13 22:52:28,574 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-13 22:52:28,574 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-13 22:52:28,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 22:52:28,796 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 22:52:28,797 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 22:52:29,089 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 22:52:29,094 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 22:52:29,094 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-13 22:52:29,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:52:29 BoogieIcfgContainer [2022-07-13 22:52:29,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 22:52:29,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 22:52:29,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 22:52:29,121 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 22:52:29,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 10:52:27" (1/3) ... [2022-07-13 22:52:29,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aea5883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:52:29, skipping insertion in model container [2022-07-13 22:52:29,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:52:28" (2/3) ... [2022-07-13 22:52:29,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2aea5883 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 10:52:29, skipping insertion in model container [2022-07-13 22:52:29,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 10:52:29" (3/3) ... [2022-07-13 22:52:29,123 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_swap_contents_harness.i [2022-07-13 22:52:29,133 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 22:52:29,143 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 22:52:29,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 22:52:29,182 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=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5c7e5ab, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@29f5747b [2022-07-13 22:52:29,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 22:52:29,185 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 70 states have (on average 1.3) internal successors, (91), 73 states have internal predecessors, (91), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-07-13 22:52:29,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:52:29,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:29,194 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:29,195 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:29,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:29,198 INFO L85 PathProgramCache]: Analyzing trace with hash -2022444143, now seen corresponding path program 1 times [2022-07-13 22:52:29,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:29,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914250014] [2022-07-13 22:52:29,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:29,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:29,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:29,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:29,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:52:29,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:52:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:29,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:52:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:29,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:52:29,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-07-13 22:52:29,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:29,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914250014] [2022-07-13 22:52:29,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914250014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:29,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:52:29,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 22:52:29,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174640294] [2022-07-13 22:52:29,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:29,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:52:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:29,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:52:29,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:52:29,737 INFO L87 Difference]: Start difference. First operand has 114 states, 70 states have (on average 1.3) internal successors, (91), 73 states have internal predecessors, (91), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:52:29,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:29,975 INFO L93 Difference]: Finished difference Result 225 states and 346 transitions. [2022-07-13 22:52:29,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:52:29,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2022-07-13 22:52:29,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:29,983 INFO L225 Difference]: With dead ends: 225 [2022-07-13 22:52:29,984 INFO L226 Difference]: Without dead ends: 107 [2022-07-13 22:52:29,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 22:52:29,989 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 49 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:29,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 162 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:52:30,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-13 22:52:30,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-13 22:52:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.265625) internal successors, (81), 68 states have internal predecessors, (81), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 22:52:30,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 147 transitions. [2022-07-13 22:52:30,021 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 147 transitions. Word has length 101 [2022-07-13 22:52:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:30,022 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 147 transitions. [2022-07-13 22:52:30,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:52:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 147 transitions. [2022-07-13 22:52:30,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:52:30,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:30,026 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:30,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 22:52:30,026 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:30,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:30,027 INFO L85 PathProgramCache]: Analyzing trace with hash 661877963, now seen corresponding path program 1 times [2022-07-13 22:52:30,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:30,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359370788] [2022-07-13 22:52:30,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:30,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:30,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:30,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:30,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:52:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:52:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:52:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:30,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:52:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,341 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-13 22:52:30,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:30,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359370788] [2022-07-13 22:52:30,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359370788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:30,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502571802] [2022-07-13 22:52:30,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:30,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:30,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:30,356 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) [2022-07-13 22:52:30,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 22:52:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:30,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 1003 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:52:30,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2022-07-13 22:52:30,704 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:30,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502571802] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:30,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:30,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2022-07-13 22:52:30,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292153871] [2022-07-13 22:52:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:30,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:52:30,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:30,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:52:30,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:52:30,707 INFO L87 Difference]: Start difference. First operand 107 states and 147 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:52:30,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:30,768 INFO L93 Difference]: Finished difference Result 207 states and 299 transitions. [2022-07-13 22:52:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:52:30,771 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2022-07-13 22:52:30,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:30,773 INFO L225 Difference]: With dead ends: 207 [2022-07-13 22:52:30,773 INFO L226 Difference]: Without dead ends: 119 [2022-07-13 22:52:30,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 22:52:30,775 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 21 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:30,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 431 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:52:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-13 22:52:30,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 109. [2022-07-13 22:52:30,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 70 states have internal predecessors, (83), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 22:52:30,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 149 transitions. [2022-07-13 22:52:30,785 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 149 transitions. Word has length 101 [2022-07-13 22:52:30,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:30,786 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 149 transitions. [2022-07-13 22:52:30,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:52:30,786 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 149 transitions. [2022-07-13 22:52:30,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:52:30,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:30,788 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:30,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:31,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:31,008 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:31,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:31,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1370013829, now seen corresponding path program 1 times [2022-07-13 22:52:31,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:31,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813762707] [2022-07-13 22:52:31,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:31,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:31,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:31,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:31,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:52:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:52:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:31,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:52:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:31,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:52:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,253 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:52:31,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:31,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813762707] [2022-07-13 22:52:31,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813762707] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:31,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259545709] [2022-07-13 22:52:31,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:31,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:31,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:31,256 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) [2022-07-13 22:52:31,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 22:52:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:31,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:52:31,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-07-13 22:52:31,630 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:31,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259545709] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:31,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:31,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-07-13 22:52:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118987231] [2022-07-13 22:52:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:31,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:52:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:31,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:52:31,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:52:31,633 INFO L87 Difference]: Start difference. First operand 109 states and 149 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:52:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:31,658 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2022-07-13 22:52:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:52:31,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2022-07-13 22:52:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:31,660 INFO L225 Difference]: With dead ends: 207 [2022-07-13 22:52:31,660 INFO L226 Difference]: Without dead ends: 117 [2022-07-13 22:52:31,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:52:31,662 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 12 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:31,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 428 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:52:31,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-13 22:52:31,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2022-07-13 22:52:31,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 68 states have (on average 1.25) internal successors, (85), 72 states have internal predecessors, (85), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 22:52:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 151 transitions. [2022-07-13 22:52:31,682 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 151 transitions. Word has length 101 [2022-07-13 22:52:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:31,683 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 151 transitions. [2022-07-13 22:52:31,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:52:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 151 transitions. [2022-07-13 22:52:31,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:52:31,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:31,686 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:31,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:31,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-07-13 22:52:31,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:31,900 INFO L85 PathProgramCache]: Analyzing trace with hash 38908607, now seen corresponding path program 1 times [2022-07-13 22:52:31,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:31,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609569494] [2022-07-13 22:52:31,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:31,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:32,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:32,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:32,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:32,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:32,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:52:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:52:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:52:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:52:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:52:32,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:32,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609569494] [2022-07-13 22:52:32,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609569494] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:32,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906933874] [2022-07-13 22:52:32,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:32,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:32,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:32,105 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) [2022-07-13 22:52:32,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 22:52:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:52:32,434 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-13 22:52:32,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:32,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906933874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:32,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:32,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2022-07-13 22:52:32,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858086177] [2022-07-13 22:52:32,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:32,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:52:32,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:32,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:52:32,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:52:32,469 INFO L87 Difference]: Start difference. First operand 111 states and 151 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:52:32,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:32,489 INFO L93 Difference]: Finished difference Result 207 states and 295 transitions. [2022-07-13 22:52:32,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:52:32,490 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 101 [2022-07-13 22:52:32,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:32,491 INFO L225 Difference]: With dead ends: 207 [2022-07-13 22:52:32,491 INFO L226 Difference]: Without dead ends: 115 [2022-07-13 22:52:32,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:52:32,492 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 3 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:32,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 427 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:52:32,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-13 22:52:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2022-07-13 22:52:32,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 71 states have (on average 1.2394366197183098) internal successors, (88), 75 states have internal predecessors, (88), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 22:52:32,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 154 transitions. [2022-07-13 22:52:32,500 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 154 transitions. Word has length 101 [2022-07-13 22:52:32,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:32,501 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 154 transitions. [2022-07-13 22:52:32,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:52:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 154 transitions. [2022-07-13 22:52:32,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:52:32,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:32,502 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:32,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:32,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:32,723 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:32,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:32,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1759122567, now seen corresponding path program 1 times [2022-07-13 22:52:32,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:32,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619436686] [2022-07-13 22:52:32,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:32,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:32,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:32,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:32,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:32,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:32,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:32,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:32,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:52:32,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:52:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:32,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:52:32,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:32,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:52:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:32,891 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:52:32,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:32,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619436686] [2022-07-13 22:52:32,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619436686] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:32,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679358026] [2022-07-13 22:52:32,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:32,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:32,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:32,899 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) [2022-07-13 22:52:32,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 22:52:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 958 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:52:33,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 22:52:33,324 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:33,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [679358026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:33,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:33,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-07-13 22:52:33,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195167381] [2022-07-13 22:52:33,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:33,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:52:33,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:33,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:52:33,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:52:33,326 INFO L87 Difference]: Start difference. First operand 114 states and 154 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:52:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:33,515 INFO L93 Difference]: Finished difference Result 216 states and 298 transitions. [2022-07-13 22:52:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:52:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2022-07-13 22:52:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:33,518 INFO L225 Difference]: With dead ends: 216 [2022-07-13 22:52:33,518 INFO L226 Difference]: Without dead ends: 121 [2022-07-13 22:52:33,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:52:33,519 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 176 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:33,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 396 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:52:33,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-13 22:52:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-13 22:52:33,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 82 states have internal predecessors, (94), 34 states have call successors, (34), 8 states have call predecessors, (34), 9 states have return successors, (36), 32 states have call predecessors, (36), 32 states have call successors, (36) [2022-07-13 22:52:33,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 164 transitions. [2022-07-13 22:52:33,528 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 164 transitions. Word has length 101 [2022-07-13 22:52:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:33,529 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 164 transitions. [2022-07-13 22:52:33,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:52:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 164 transitions. [2022-07-13 22:52:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:52:33,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:33,530 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:33,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:33,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:33,745 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:33,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:33,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1159297143, now seen corresponding path program 1 times [2022-07-13 22:52:33,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:33,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549739167] [2022-07-13 22:52:33,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:33,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:33,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:33,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:52:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:52:33,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:33,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:52:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:52:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:52:33,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:33,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549739167] [2022-07-13 22:52:33,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549739167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:33,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758357229] [2022-07-13 22:52:33,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:33,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:33,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:33,956 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:33,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 22:52:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:34,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 22:52:34,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:34,405 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-07-13 22:52:34,406 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:34,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758357229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:34,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:34,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-07-13 22:52:34,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755878601] [2022-07-13 22:52:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:34,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 22:52:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:34,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 22:52:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:52:34,407 INFO L87 Difference]: Start difference. First operand 121 states and 164 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:52:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:34,598 INFO L93 Difference]: Finished difference Result 220 states and 299 transitions. [2022-07-13 22:52:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 22:52:34,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 101 [2022-07-13 22:52:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:34,600 INFO L225 Difference]: With dead ends: 220 [2022-07-13 22:52:34,600 INFO L226 Difference]: Without dead ends: 121 [2022-07-13 22:52:34,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:52:34,601 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 175 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:34,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 397 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:52:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-13 22:52:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-13 22:52:34,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 77 states have (on average 1.2207792207792207) internal successors, (94), 82 states have internal predecessors, (94), 34 states have call successors, (34), 8 states have call predecessors, (34), 9 states have return successors, (33), 32 states have call predecessors, (33), 32 states have call successors, (33) [2022-07-13 22:52:34,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2022-07-13 22:52:34,608 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 101 [2022-07-13 22:52:34,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:34,608 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2022-07-13 22:52:34,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 states have internal predecessors, (57), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:52:34,609 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2022-07-13 22:52:34,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-13 22:52:34,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:34,609 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:34,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:34,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:34,826 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:34,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:34,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1251856495, now seen corresponding path program 1 times [2022-07-13 22:52:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:34,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816000180] [2022-07-13 22:52:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:34,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:34,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:34,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:34,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:34,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:34,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:34,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:34,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:34,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:34,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:34,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:34,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-13 22:52:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:35,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-13 22:52:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:35,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:52:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:35,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:52:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:35,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:35,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:52:35,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:35,038 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 22:52:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:35,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816000180] [2022-07-13 22:52:35,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816000180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:35,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766850103] [2022-07-13 22:52:35,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:35,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:35,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:35,040 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:35,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 22:52:35,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:35,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 1018 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 22:52:35,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 22:52:35,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:35,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766850103] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:35,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:35,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 12 [2022-07-13 22:52:35,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727012156] [2022-07-13 22:52:35,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:35,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:52:35,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:35,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:52:35,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:52:35,521 INFO L87 Difference]: Start difference. First operand 121 states and 161 transitions. Second operand has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 22:52:35,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:35,788 INFO L93 Difference]: Finished difference Result 225 states and 307 transitions. [2022-07-13 22:52:35,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:52:35,788 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) Word has length 101 [2022-07-13 22:52:35,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:35,789 INFO L225 Difference]: With dead ends: 225 [2022-07-13 22:52:35,789 INFO L226 Difference]: Without dead ends: 123 [2022-07-13 22:52:35,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:52:35,791 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 158 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:35,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 607 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:52:35,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-13 22:52:35,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-07-13 22:52:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.2179487179487178) internal successors, (95), 84 states have internal predecessors, (95), 34 states have call successors, (34), 8 states have call predecessors, (34), 10 states have return successors, (39), 32 states have call predecessors, (39), 32 states have call successors, (39) [2022-07-13 22:52:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 168 transitions. [2022-07-13 22:52:35,799 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 168 transitions. Word has length 101 [2022-07-13 22:52:35,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:35,799 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 168 transitions. [2022-07-13 22:52:35,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 5 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (11), 4 states have call predecessors, (11), 5 states have call successors, (11) [2022-07-13 22:52:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 168 transitions. [2022-07-13 22:52:35,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-13 22:52:35,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:35,800 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:35,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:36,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:36,017 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:36,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash -657271923, now seen corresponding path program 1 times [2022-07-13 22:52:36,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:36,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091580396] [2022-07-13 22:52:36,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-13 22:52:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-13 22:52:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-13 22:52:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-13 22:52:36,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:52:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:52:36,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:36,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091580396] [2022-07-13 22:52:36,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091580396] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:36,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671303023] [2022-07-13 22:52:36,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:36,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:36,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:36,208 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:36,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 22:52:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:36,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 22:52:36,647 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 22:52:36,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:36,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [671303023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:36,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:36,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-07-13 22:52:36,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78964400] [2022-07-13 22:52:36,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:36,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:52:36,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:36,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:52:36,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:52:36,718 INFO L87 Difference]: Start difference. First operand 123 states and 168 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:52:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:36,966 INFO L93 Difference]: Finished difference Result 230 states and 322 transitions. [2022-07-13 22:52:36,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:52:36,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 103 [2022-07-13 22:52:36,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:36,967 INFO L225 Difference]: With dead ends: 230 [2022-07-13 22:52:36,967 INFO L226 Difference]: Without dead ends: 126 [2022-07-13 22:52:36,968 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:52:36,969 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 184 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:36,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 536 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:52:36,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-13 22:52:36,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-13 22:52:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.2125) internal successors, (97), 87 states have internal predecessors, (97), 34 states have call successors, (34), 8 states have call predecessors, (34), 11 states have return successors, (43), 32 states have call predecessors, (43), 32 states have call successors, (43) [2022-07-13 22:52:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 174 transitions. [2022-07-13 22:52:36,977 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 174 transitions. Word has length 103 [2022-07-13 22:52:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:36,977 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 174 transitions. [2022-07-13 22:52:36,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 8 states have internal predecessors, (49), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:52:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 174 transitions. [2022-07-13 22:52:36,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-13 22:52:36,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:36,979 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:36,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:37,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:37,197 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:37,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash 76379770, now seen corresponding path program 1 times [2022-07-13 22:52:37,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:37,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720693590] [2022-07-13 22:52:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:37,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:37,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:37,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-13 22:52:37,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-13 22:52:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:52:37,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-13 22:52:37,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:37,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:52:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:52:37,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:37,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720693590] [2022-07-13 22:52:37,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720693590] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:37,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314602947] [2022-07-13 22:52:37,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:37,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:37,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:37,381 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:37,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-13 22:52:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:37,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 22:52:37,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:37,995 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 22:52:37,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:37,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314602947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:37,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:37,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2022-07-13 22:52:37,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334237514] [2022-07-13 22:52:37,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:37,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:52:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:37,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:52:37,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-07-13 22:52:37,997 INFO L87 Difference]: Start difference. First operand 126 states and 174 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:52:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:38,370 INFO L93 Difference]: Finished difference Result 245 states and 353 transitions. [2022-07-13 22:52:38,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:52:38,370 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 105 [2022-07-13 22:52:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:38,371 INFO L225 Difference]: With dead ends: 245 [2022-07-13 22:52:38,371 INFO L226 Difference]: Without dead ends: 138 [2022-07-13 22:52:38,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2022-07-13 22:52:38,372 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 221 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:38,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 616 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:52:38,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-13 22:52:38,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 128. [2022-07-13 22:52:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.2195121951219512) internal successors, (100), 89 states have internal predecessors, (100), 34 states have call successors, (34), 8 states have call predecessors, (34), 11 states have return successors, (43), 32 states have call predecessors, (43), 32 states have call successors, (43) [2022-07-13 22:52:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 177 transitions. [2022-07-13 22:52:38,380 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 177 transitions. Word has length 105 [2022-07-13 22:52:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:38,381 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 177 transitions. [2022-07-13 22:52:38,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 9 states have internal predecessors, (51), 4 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-07-13 22:52:38,381 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 177 transitions. [2022-07-13 22:52:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-13 22:52:38,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:38,382 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:38,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-13 22:52:38,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-13 22:52:38,601 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:38,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:38,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1876687072, now seen corresponding path program 1 times [2022-07-13 22:52:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:38,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025541242] [2022-07-13 22:52:38,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:38,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:38,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:38,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:38,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-13 22:52:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-13 22:52:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-13 22:52:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:52:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-07-13 22:52:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-07-13 22:52:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:38,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025541242] [2022-07-13 22:52:38,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025541242] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:38,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915061397] [2022-07-13 22:52:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:38,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:38,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:38,780 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:38,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-13 22:52:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 1042 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 22:52:39,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:39,312 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-07-13 22:52:39,312 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:39,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915061397] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:39,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:39,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-07-13 22:52:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448164638] [2022-07-13 22:52:39,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:39,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 22:52:39,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:39,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 22:52:39,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:52:39,314 INFO L87 Difference]: Start difference. First operand 128 states and 177 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:52:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:39,333 INFO L93 Difference]: Finished difference Result 246 states and 361 transitions. [2022-07-13 22:52:39,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 22:52:39,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2022-07-13 22:52:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:39,335 INFO L225 Difference]: With dead ends: 246 [2022-07-13 22:52:39,335 INFO L226 Difference]: Without dead ends: 137 [2022-07-13 22:52:39,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-13 22:52:39,336 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 6 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:39,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 296 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:52:39,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-13 22:52:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 129. [2022-07-13 22:52:39,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.216867469879518) internal successors, (101), 90 states have internal predecessors, (101), 34 states have call successors, (34), 8 states have call predecessors, (34), 11 states have return successors, (43), 32 states have call predecessors, (43), 32 states have call successors, (43) [2022-07-13 22:52:39,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2022-07-13 22:52:39,344 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 178 transitions. Word has length 106 [2022-07-13 22:52:39,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:39,344 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 178 transitions. [2022-07-13 22:52:39,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-13 22:52:39,345 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2022-07-13 22:52:39,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-13 22:52:39,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:39,346 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:39,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:39,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-13 22:52:39,563 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:39,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1115937726, now seen corresponding path program 1 times [2022-07-13 22:52:39,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:39,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210732148] [2022-07-13 22:52:39,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:39,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:39,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:39,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:39,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-13 22:52:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-13 22:52:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:52:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:52:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:39,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:52:39,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:39,766 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-13 22:52:39,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:39,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210732148] [2022-07-13 22:52:39,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210732148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:39,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81900135] [2022-07-13 22:52:39,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:39,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:39,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:39,772 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:39,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-13 22:52:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:40,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 22:52:40,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:40,392 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-13 22:52:40,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:40,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81900135] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:40,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:40,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 13 [2022-07-13 22:52:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368111517] [2022-07-13 22:52:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:40,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:52:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:52:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:52:40,395 INFO L87 Difference]: Start difference. First operand 129 states and 178 transitions. Second operand has 10 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-13 22:52:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:40,724 INFO L93 Difference]: Finished difference Result 245 states and 348 transitions. [2022-07-13 22:52:40,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:52:40,724 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) Word has length 114 [2022-07-13 22:52:40,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:40,725 INFO L225 Difference]: With dead ends: 245 [2022-07-13 22:52:40,725 INFO L226 Difference]: Without dead ends: 135 [2022-07-13 22:52:40,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:52:40,726 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 161 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:40,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 713 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:52:40,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-13 22:52:40,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 130. [2022-07-13 22:52:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 91 states have internal predecessors, (102), 34 states have call successors, (34), 8 states have call predecessors, (34), 11 states have return successors, (43), 32 states have call predecessors, (43), 32 states have call successors, (43) [2022-07-13 22:52:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 179 transitions. [2022-07-13 22:52:40,734 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 179 transitions. Word has length 114 [2022-07-13 22:52:40,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:40,734 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 179 transitions. [2022-07-13 22:52:40,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 5 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 4 states have call predecessors, (12), 5 states have call successors, (12) [2022-07-13 22:52:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 179 transitions. [2022-07-13 22:52:40,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-13 22:52:40,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:40,735 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:40,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:40,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-13 22:52:40,955 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:40,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:40,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1680174575, now seen corresponding path program 1 times [2022-07-13 22:52:40,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:40,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587848179] [2022-07-13 22:52:40,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:40,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:41,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:41,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:41,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-13 22:52:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-13 22:52:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:52:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-13 22:52:41,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-13 22:52:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-13 22:52:41,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:41,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587848179] [2022-07-13 22:52:41,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587848179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:41,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632828034] [2022-07-13 22:52:41,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:41,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:41,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:41,197 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:41,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-13 22:52:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:41,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-13 22:52:41,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:41,882 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-13 22:52:41,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:41,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632828034] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:41,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:41,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2022-07-13 22:52:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131250492] [2022-07-13 22:52:41,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:41,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:52:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:41,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:52:41,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:52:41,883 INFO L87 Difference]: Start difference. First operand 130 states and 179 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 6 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 22:52:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:42,317 INFO L93 Difference]: Finished difference Result 250 states and 358 transitions. [2022-07-13 22:52:42,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-13 22:52:42,318 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 6 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 116 [2022-07-13 22:52:42,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:42,319 INFO L225 Difference]: With dead ends: 250 [2022-07-13 22:52:42,319 INFO L226 Difference]: Without dead ends: 139 [2022-07-13 22:52:42,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2022-07-13 22:52:42,320 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 165 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:42,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 899 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:52:42,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-13 22:52:42,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 131. [2022-07-13 22:52:42,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.2117647058823529) internal successors, (103), 92 states have internal predecessors, (103), 34 states have call successors, (34), 8 states have call predecessors, (34), 11 states have return successors, (43), 32 states have call predecessors, (43), 32 states have call successors, (43) [2022-07-13 22:52:42,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2022-07-13 22:52:42,327 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 180 transitions. Word has length 116 [2022-07-13 22:52:42,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:42,327 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 180 transitions. [2022-07-13 22:52:42,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 10 states have internal predecessors, (63), 6 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-13 22:52:42,327 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-07-13 22:52:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-13 22:52:42,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:42,328 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:42,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:42,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-13 22:52:42,538 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:42,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:42,539 INFO L85 PathProgramCache]: Analyzing trace with hash 54718475, now seen corresponding path program 1 times [2022-07-13 22:52:42,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:42,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107779745] [2022-07-13 22:52:42,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:42,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:42,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:42,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:52:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:52:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-13 22:52:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-13 22:52:42,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-13 22:52:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 22:52:42,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:42,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107779745] [2022-07-13 22:52:42,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107779745] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:42,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815614377] [2022-07-13 22:52:42,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:42,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:42,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:42,740 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:42,741 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-13 22:52:43,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:43,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-13 22:52:43,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:43,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-13 22:52:43,690 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 17 treesize of output 9 [2022-07-13 22:52:43,715 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 39 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 22:52:43,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:52:43,956 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:52:43,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 26 treesize of output 29 [2022-07-13 22:52:43,963 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:52:43,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 24 treesize of output 27 [2022-07-13 22:52:44,080 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:52:44,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815614377] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:52:44,080 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:52:44,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12, 9] total 20 [2022-07-13 22:52:44,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463704610] [2022-07-13 22:52:44,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:52:44,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 22:52:44,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:44,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 22:52:44,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:52:44,081 INFO L87 Difference]: Start difference. First operand 131 states and 180 transitions. Second operand has 20 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 10 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (26), 9 states have call predecessors, (26), 10 states have call successors, (26) [2022-07-13 22:52:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:47,095 INFO L93 Difference]: Finished difference Result 442 states and 786 transitions. [2022-07-13 22:52:47,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-13 22:52:47,095 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 10 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (26), 9 states have call predecessors, (26), 10 states have call successors, (26) Word has length 117 [2022-07-13 22:52:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:47,098 INFO L225 Difference]: With dead ends: 442 [2022-07-13 22:52:47,098 INFO L226 Difference]: Without dead ends: 316 [2022-07-13 22:52:47,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 253 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=1577, Unknown=0, NotChecked=0, Total=1806 [2022-07-13 22:52:47,100 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 278 mSDsluCounter, 1805 mSDsCounter, 0 mSdLazyCounter, 3758 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 2089 SdHoareTripleChecker+Invalid, 4846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 3758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 581 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:47,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 2089 Invalid, 4846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 3758 Invalid, 0 Unknown, 581 Unchecked, 2.5s Time] [2022-07-13 22:52:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-07-13 22:52:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 170. [2022-07-13 22:52:47,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 113 states have (on average 1.2035398230088497) internal successors, (136), 123 states have internal predecessors, (136), 40 states have call successors, (40), 10 states have call predecessors, (40), 16 states have return successors, (69), 39 states have call predecessors, (69), 38 states have call successors, (69) [2022-07-13 22:52:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 245 transitions. [2022-07-13 22:52:47,153 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 245 transitions. Word has length 117 [2022-07-13 22:52:47,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:47,153 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 245 transitions. [2022-07-13 22:52:47,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 6.0) internal successors, (108), 18 states have internal predecessors, (108), 10 states have call successors, (28), 4 states have call predecessors, (28), 6 states have return successors, (26), 9 states have call predecessors, (26), 10 states have call successors, (26) [2022-07-13 22:52:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 245 transitions. [2022-07-13 22:52:47,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-13 22:52:47,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:47,154 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:47,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:47,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-13 22:52:47,355 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:47,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:47,355 INFO L85 PathProgramCache]: Analyzing trace with hash -577288815, now seen corresponding path program 1 times [2022-07-13 22:52:47,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:47,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510961995] [2022-07-13 22:52:47,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:47,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:47,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:47,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:47,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:52:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:52:47,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-13 22:52:47,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-13 22:52:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:47,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:52:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:52:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-13 22:52:47,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:47,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510961995] [2022-07-13 22:52:47,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510961995] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:47,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7530940] [2022-07-13 22:52:47,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:47,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:47,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:47,536 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:47,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-13 22:52:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 22:52:48,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 22:52:48,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:48,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7530940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:48,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:48,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2022-07-13 22:52:48,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895099876] [2022-07-13 22:52:48,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:48,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 22:52:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:48,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 22:52:48,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:52:48,151 INFO L87 Difference]: Start difference. First operand 170 states and 245 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:52:48,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:48,367 INFO L93 Difference]: Finished difference Result 302 states and 435 transitions. [2022-07-13 22:52:48,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 22:52:48,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 126 [2022-07-13 22:52:48,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:48,369 INFO L225 Difference]: With dead ends: 302 [2022-07-13 22:52:48,369 INFO L226 Difference]: Without dead ends: 167 [2022-07-13 22:52:48,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:52:48,370 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 183 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:48,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 539 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:52:48,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-13 22:52:48,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-07-13 22:52:48,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 110 states have (on average 1.2) internal successors, (132), 118 states have internal predecessors, (132), 40 states have call successors, (40), 10 states have call predecessors, (40), 14 states have return successors, (64), 39 states have call predecessors, (64), 38 states have call successors, (64) [2022-07-13 22:52:48,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 236 transitions. [2022-07-13 22:52:48,380 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 236 transitions. Word has length 126 [2022-07-13 22:52:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:48,380 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 236 transitions. [2022-07-13 22:52:48,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:52:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 236 transitions. [2022-07-13 22:52:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-13 22:52:48,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:48,381 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:48,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:48,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-13 22:52:48,603 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:48,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:48,603 INFO L85 PathProgramCache]: Analyzing trace with hash -692231420, now seen corresponding path program 1 times [2022-07-13 22:52:48,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:48,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244512331] [2022-07-13 22:52:48,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:48,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:48,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:52:48,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:52:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-13 22:52:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-13 22:52:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-13 22:52:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:52:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:48,816 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-13 22:52:48,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:48,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244512331] [2022-07-13 22:52:48,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244512331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:48,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131270881] [2022-07-13 22:52:48,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:48,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:48,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:48,832 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:48,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-13 22:52:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:49,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 730 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 22:52:49,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:49,625 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-07-13 22:52:49,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:49,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131270881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:49,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:49,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2022-07-13 22:52:49,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043200801] [2022-07-13 22:52:49,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:49,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:52:49,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:52:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:52:49,627 INFO L87 Difference]: Start difference. First operand 165 states and 236 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:52:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:49,932 INFO L93 Difference]: Finished difference Result 300 states and 433 transitions. [2022-07-13 22:52:49,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:52:49,932 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) Word has length 128 [2022-07-13 22:52:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:49,933 INFO L225 Difference]: With dead ends: 300 [2022-07-13 22:52:49,934 INFO L226 Difference]: Without dead ends: 170 [2022-07-13 22:52:49,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:52:49,935 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 213 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:49,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 621 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:52:49,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-13 22:52:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2022-07-13 22:52:49,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 108 states have (on average 1.2037037037037037) internal successors, (130), 115 states have internal predecessors, (130), 40 states have call successors, (40), 10 states have call predecessors, (40), 13 states have return successors, (59), 39 states have call predecessors, (59), 38 states have call successors, (59) [2022-07-13 22:52:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 229 transitions. [2022-07-13 22:52:49,947 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 229 transitions. Word has length 128 [2022-07-13 22:52:49,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:49,947 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 229 transitions. [2022-07-13 22:52:49,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 9 states have internal predecessors, (75), 4 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 4 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:52:49,947 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 229 transitions. [2022-07-13 22:52:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-13 22:52:49,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:49,948 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:49,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:50,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:50,157 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:50,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1728472669, now seen corresponding path program 1 times [2022-07-13 22:52:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:50,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816887235] [2022-07-13 22:52:50,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:50,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:50,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:50,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:50,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:52:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:52:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:52:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:52:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:52:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:50,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 22:52:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 22:52:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,338 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-13 22:52:50,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:50,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816887235] [2022-07-13 22:52:50,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816887235] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:50,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:52:50,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:52:50,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165880581] [2022-07-13 22:52:50,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:50,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:52:50,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:50,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:52:50,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:52:50,340 INFO L87 Difference]: Start difference. First operand 162 states and 229 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 7 states have internal predecessors, (59), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:52:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:50,779 INFO L93 Difference]: Finished difference Result 288 states and 413 transitions. [2022-07-13 22:52:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:52:50,779 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 7 states have internal predecessors, (59), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 148 [2022-07-13 22:52:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:50,780 INFO L225 Difference]: With dead ends: 288 [2022-07-13 22:52:50,781 INFO L226 Difference]: Without dead ends: 175 [2022-07-13 22:52:50,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-13 22:52:50,782 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 109 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:50,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 393 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:52:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-13 22:52:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-07-13 22:52:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 114 states have (on average 1.1929824561403508) internal successors, (136), 122 states have internal predecessors, (136), 45 states have call successors, (45), 11 states have call predecessors, (45), 15 states have return successors, (69), 44 states have call predecessors, (69), 43 states have call successors, (69) [2022-07-13 22:52:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 250 transitions. [2022-07-13 22:52:50,792 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 250 transitions. Word has length 148 [2022-07-13 22:52:50,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:50,793 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 250 transitions. [2022-07-13 22:52:50,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 7 states have internal predecessors, (59), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:52:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 250 transitions. [2022-07-13 22:52:50,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-13 22:52:50,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:50,794 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:50,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-13 22:52:50,794 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash 535862326, now seen corresponding path program 1 times [2022-07-13 22:52:50,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:50,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56023868] [2022-07-13 22:52:50,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:50,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:50,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:50,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:52:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:52:50,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-13 22:52:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-13 22:52:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:52:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-13 22:52:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-13 22:52:50,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:50,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56023868] [2022-07-13 22:52:50,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56023868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:50,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903277745] [2022-07-13 22:52:50,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:50,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:50,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:50,988 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:50,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-13 22:52:51,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:51,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 22:52:51,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:51,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,677 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:52:51,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:52:51,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:52:51,879 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 22:52:51,879 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:52:51,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903277745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:52:51,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:52:51,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2022-07-13 22:52:51,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190884751] [2022-07-13 22:52:51,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:52:51,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:52:51,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:51,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:52:51,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:52:51,881 INFO L87 Difference]: Start difference. First operand 175 states and 250 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-13 22:52:52,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:52,013 INFO L93 Difference]: Finished difference Result 324 states and 453 transitions. [2022-07-13 22:52:52,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:52:52,014 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 137 [2022-07-13 22:52:52,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:52,015 INFO L225 Difference]: With dead ends: 324 [2022-07-13 22:52:52,015 INFO L226 Difference]: Without dead ends: 191 [2022-07-13 22:52:52,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:52:52,016 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 55 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:52,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 780 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 50 Invalid, 0 Unknown, 69 Unchecked, 0.1s Time] [2022-07-13 22:52:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-13 22:52:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-07-13 22:52:52,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 129 states have (on average 1.193798449612403) internal successors, (154), 137 states have internal predecessors, (154), 45 states have call successors, (45), 12 states have call predecessors, (45), 16 states have return successors, (69), 44 states have call predecessors, (69), 43 states have call successors, (69) [2022-07-13 22:52:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 268 transitions. [2022-07-13 22:52:52,029 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 268 transitions. Word has length 137 [2022-07-13 22:52:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:52,032 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 268 transitions. [2022-07-13 22:52:52,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-13 22:52:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 268 transitions. [2022-07-13 22:52:52,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-13 22:52:52,038 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:52,038 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:52,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:52,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-13 22:52:52,260 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:52,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -582493847, now seen corresponding path program 1 times [2022-07-13 22:52:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:52,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87315577] [2022-07-13 22:52:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:52,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:52,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:52:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:52:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:52:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-13 22:52:52,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-13 22:52:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-13 22:52:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 22:52:52,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-13 22:52:52,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:52,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87315577] [2022-07-13 22:52:52,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87315577] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:52,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96986015] [2022-07-13 22:52:52,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:52,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:52,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:52,467 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:52,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-13 22:52:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:53,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 818 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 22:52:53,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 72 proven. 3 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-07-13 22:52:53,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:52:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2022-07-13 22:52:53,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96986015] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:52:53,319 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:52:53,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 7] total 19 [2022-07-13 22:52:53,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23631889] [2022-07-13 22:52:53,320 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:52:53,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-13 22:52:53,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:53,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-13 22:52:53,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2022-07-13 22:52:53,321 INFO L87 Difference]: Start difference. First operand 191 states and 268 transitions. Second operand has 19 states, 16 states have (on average 5.4375) internal successors, (87), 14 states have internal predecessors, (87), 5 states have call successors, (23), 3 states have call predecessors, (23), 8 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-13 22:52:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:52:54,084 INFO L93 Difference]: Finished difference Result 353 states and 503 transitions. [2022-07-13 22:52:54,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-13 22:52:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 5.4375) internal successors, (87), 14 states have internal predecessors, (87), 5 states have call successors, (23), 3 states have call predecessors, (23), 8 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) Word has length 148 [2022-07-13 22:52:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:52:54,086 INFO L225 Difference]: With dead ends: 353 [2022-07-13 22:52:54,086 INFO L226 Difference]: Without dead ends: 201 [2022-07-13 22:52:54,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2022-07-13 22:52:54,087 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 63 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1243 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:52:54,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 941 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1243 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:52:54,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-13 22:52:54,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 194. [2022-07-13 22:52:54,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 131 states have (on average 1.1908396946564885) internal successors, (156), 140 states have internal predecessors, (156), 45 states have call successors, (45), 12 states have call predecessors, (45), 17 states have return successors, (75), 44 states have call predecessors, (75), 43 states have call successors, (75) [2022-07-13 22:52:54,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 276 transitions. [2022-07-13 22:52:54,098 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 276 transitions. Word has length 148 [2022-07-13 22:52:54,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:52:54,098 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 276 transitions. [2022-07-13 22:52:54,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 5.4375) internal successors, (87), 14 states have internal predecessors, (87), 5 states have call successors, (23), 3 states have call predecessors, (23), 8 states have return successors, (23), 6 states have call predecessors, (23), 5 states have call successors, (23) [2022-07-13 22:52:54,098 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 276 transitions. [2022-07-13 22:52:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-13 22:52:54,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:52:54,099 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:52:54,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-13 22:52:54,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-13 22:52:54,321 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:52:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:52:54,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1421909977, now seen corresponding path program 1 times [2022-07-13 22:52:54,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:52:54,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800761063] [2022-07-13 22:52:54,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:52:54,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:52:54,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:52:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:54,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:52:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:52:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:52:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:52:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:52:54,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-13 22:52:54,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-13 22:52:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:52:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-13 22:52:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 22:52:54,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:54,537 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-13 22:52:54,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:52:54,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800761063] [2022-07-13 22:52:54,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800761063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:52:54,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531186252] [2022-07-13 22:52:54,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:52:54,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:52:54,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:52:54,539 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:52:54,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-13 22:52:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:52:55,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 51 conjunts are in the unsatisfiable core [2022-07-13 22:52:55,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:52:55,245 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:52:55,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 22:52:55,253 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:52:55,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 22:52:56,117 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3| Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3|)))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_3|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_3|) 0)))) is different from true [2022-07-13 22:52:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 90 proven. 1 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-13 22:52:56,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:52:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2022-07-13 22:52:56,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531186252] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:52:56,337 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:52:56,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 8] total 20 [2022-07-13 22:52:56,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196574767] [2022-07-13 22:52:56,338 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:52:56,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-13 22:52:56,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:52:56,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-13 22:52:56,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=295, Unknown=1, NotChecked=34, Total=380 [2022-07-13 22:52:56,339 INFO L87 Difference]: Start difference. First operand 194 states and 276 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (31), 4 states have call predecessors, (31), 3 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2022-07-13 22:53:00,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:00,692 INFO L93 Difference]: Finished difference Result 409 states and 638 transitions. [2022-07-13 22:53:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-13 22:53:00,692 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (31), 4 states have call predecessors, (31), 3 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) Word has length 139 [2022-07-13 22:53:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:00,696 INFO L225 Difference]: With dead ends: 409 [2022-07-13 22:53:00,696 INFO L226 Difference]: Without dead ends: 250 [2022-07-13 22:53:00,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 309 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=219, Invalid=1040, Unknown=5, NotChecked=68, Total=1332 [2022-07-13 22:53:00,698 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 222 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 1875 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:00,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 720 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1875 Invalid, 0 Unknown, 253 Unchecked, 1.1s Time] [2022-07-13 22:53:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-07-13 22:53:00,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 200. [2022-07-13 22:53:00,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 136 states have (on average 1.1838235294117647) internal successors, (161), 145 states have internal predecessors, (161), 45 states have call successors, (45), 13 states have call predecessors, (45), 18 states have return successors, (76), 44 states have call predecessors, (76), 43 states have call successors, (76) [2022-07-13 22:53:00,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 282 transitions. [2022-07-13 22:53:00,743 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 282 transitions. Word has length 139 [2022-07-13 22:53:00,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:00,744 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 282 transitions. [2022-07-13 22:53:00,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 7 states have call successors, (31), 4 states have call predecessors, (31), 3 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2022-07-13 22:53:00,744 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 282 transitions. [2022-07-13 22:53:00,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-13 22:53:00,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:00,745 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:00,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:00,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:00,966 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:00,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:00,966 INFO L85 PathProgramCache]: Analyzing trace with hash 806993753, now seen corresponding path program 1 times [2022-07-13 22:53:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:00,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434750929] [2022-07-13 22:53:00,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:00,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:01,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:01,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:01,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:01,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:01,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:53:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:53:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:53:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:53:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 22:53:01,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:01,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434750929] [2022-07-13 22:53:01,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434750929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:01,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:53:01,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 22:53:01,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191998361] [2022-07-13 22:53:01,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:01,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:53:01,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:01,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:53:01,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:53:01,224 INFO L87 Difference]: Start difference. First operand 200 states and 282 transitions. Second operand has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 7 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-13 22:53:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:01,884 INFO L93 Difference]: Finished difference Result 337 states and 478 transitions. [2022-07-13 22:53:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:53:01,885 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 7 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) Word has length 140 [2022-07-13 22:53:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:01,886 INFO L225 Difference]: With dead ends: 337 [2022-07-13 22:53:01,886 INFO L226 Difference]: Without dead ends: 203 [2022-07-13 22:53:01,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:53:01,887 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 119 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:01,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 501 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-13 22:53:01,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-13 22:53:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2022-07-13 22:53:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 136 states have (on average 1.1764705882352942) internal successors, (160), 145 states have internal predecessors, (160), 45 states have call successors, (45), 13 states have call predecessors, (45), 18 states have return successors, (76), 44 states have call predecessors, (76), 43 states have call successors, (76) [2022-07-13 22:53:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 281 transitions. [2022-07-13 22:53:01,906 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 281 transitions. Word has length 140 [2022-07-13 22:53:01,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:01,907 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 281 transitions. [2022-07-13 22:53:01,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 7 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 6 states have call successors, (13) [2022-07-13 22:53:01,907 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 281 transitions. [2022-07-13 22:53:01,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-13 22:53:01,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:01,908 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:01,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-13 22:53:01,908 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:01,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:01,909 INFO L85 PathProgramCache]: Analyzing trace with hash 413966743, now seen corresponding path program 1 times [2022-07-13 22:53:01,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:01,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431176062] [2022-07-13 22:53:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:01,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:02,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:02,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:02,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:53:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:53:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:53:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:53:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 22:53:02,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:02,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431176062] [2022-07-13 22:53:02,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431176062] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:02,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:53:02,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:53:02,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210426262] [2022-07-13 22:53:02,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:02,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:53:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:02,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:53:02,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:53:02,163 INFO L87 Difference]: Start difference. First operand 200 states and 281 transitions. Second operand has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 22:53:02,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:02,640 INFO L93 Difference]: Finished difference Result 342 states and 483 transitions. [2022-07-13 22:53:02,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:53:02,640 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 140 [2022-07-13 22:53:02,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:02,641 INFO L225 Difference]: With dead ends: 342 [2022-07-13 22:53:02,641 INFO L226 Difference]: Without dead ends: 206 [2022-07-13 22:53:02,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:53:02,642 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 102 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:02,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 385 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:53:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-13 22:53:02,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2022-07-13 22:53:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 140 states have (on average 1.1642857142857144) internal successors, (163), 150 states have internal predecessors, (163), 45 states have call successors, (45), 13 states have call predecessors, (45), 19 states have return successors, (80), 44 states have call predecessors, (80), 43 states have call successors, (80) [2022-07-13 22:53:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 288 transitions. [2022-07-13 22:53:02,657 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 288 transitions. Word has length 140 [2022-07-13 22:53:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:02,657 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 288 transitions. [2022-07-13 22:53:02,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 8.285714285714286) internal successors, (58), 8 states have internal predecessors, (58), 4 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2022-07-13 22:53:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 288 transitions. [2022-07-13 22:53:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-13 22:53:02,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:02,659 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:02,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-13 22:53:02,659 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:02,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:02,659 INFO L85 PathProgramCache]: Analyzing trace with hash -916367168, now seen corresponding path program 1 times [2022-07-13 22:53:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:02,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009109190] [2022-07-13 22:53:02,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:02,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:02,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:02,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:53:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:53:02,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:53:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:53:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:53:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:02,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:53:02,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,003 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-13 22:53:03,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:03,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009109190] [2022-07-13 22:53:03,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009109190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:03,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:53:03,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 22:53:03,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37397857] [2022-07-13 22:53:03,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:03,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:53:03,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:03,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:53:03,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:53:03,009 INFO L87 Difference]: Start difference. First operand 205 states and 288 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-13 22:53:03,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:03,718 INFO L93 Difference]: Finished difference Result 344 states and 489 transitions. [2022-07-13 22:53:03,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:53:03,719 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 151 [2022-07-13 22:53:03,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:03,721 INFO L225 Difference]: With dead ends: 344 [2022-07-13 22:53:03,721 INFO L226 Difference]: Without dead ends: 201 [2022-07-13 22:53:03,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:53:03,723 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 133 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:03,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 479 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:53:03,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-13 22:53:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2022-07-13 22:53:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 134 states have (on average 1.164179104477612) internal successors, (156), 143 states have internal predecessors, (156), 45 states have call successors, (45), 13 states have call predecessors, (45), 18 states have return successors, (79), 44 states have call predecessors, (79), 43 states have call successors, (79) [2022-07-13 22:53:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 280 transitions. [2022-07-13 22:53:03,734 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 280 transitions. Word has length 151 [2022-07-13 22:53:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:03,734 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 280 transitions. [2022-07-13 22:53:03,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-13 22:53:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 280 transitions. [2022-07-13 22:53:03,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 22:53:03,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:03,736 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:03,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-13 22:53:03,736 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:03,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:03,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1841043424, now seen corresponding path program 1 times [2022-07-13 22:53:03,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:03,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121707759] [2022-07-13 22:53:03,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:03,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:03,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:03,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:03,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:03,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:53:03,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:53:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:03,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:53:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:03,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 22:53:03,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:04,021 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 33 proven. 10 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 22:53:04,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:04,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121707759] [2022-07-13 22:53:04,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121707759] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:04,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340428030] [2022-07-13 22:53:04,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:04,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:04,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:04,044 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:04,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-13 22:53:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:04,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 22:53:04,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 22:53:04,866 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:53:04,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340428030] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:04,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:53:04,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2022-07-13 22:53:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178173579] [2022-07-13 22:53:04,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:04,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:53:04,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:04,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:53:04,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=335, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:53:04,868 INFO L87 Difference]: Start difference. First operand 198 states and 280 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:53:05,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:05,124 INFO L93 Difference]: Finished difference Result 320 states and 447 transitions. [2022-07-13 22:53:05,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:53:05,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 141 [2022-07-13 22:53:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:05,126 INFO L225 Difference]: With dead ends: 320 [2022-07-13 22:53:05,126 INFO L226 Difference]: Without dead ends: 189 [2022-07-13 22:53:05,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2022-07-13 22:53:05,127 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 184 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:05,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 637 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:53:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-07-13 22:53:05,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-07-13 22:53:05,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 126 states have (on average 1.1666666666666667) internal successors, (147), 134 states have internal predecessors, (147), 45 states have call successors, (45), 13 states have call predecessors, (45), 17 states have return successors, (78), 44 states have call predecessors, (78), 43 states have call successors, (78) [2022-07-13 22:53:05,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 270 transitions. [2022-07-13 22:53:05,139 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 270 transitions. Word has length 141 [2022-07-13 22:53:05,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:05,139 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 270 transitions. [2022-07-13 22:53:05,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 8 states have internal predecessors, (59), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:53:05,139 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 270 transitions. [2022-07-13 22:53:05,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 22:53:05,140 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:05,140 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:05,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-13 22:53:05,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:05,355 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:05,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:05,356 INFO L85 PathProgramCache]: Analyzing trace with hash -498598424, now seen corresponding path program 1 times [2022-07-13 22:53:05,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:05,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439259539] [2022-07-13 22:53:05,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:05,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:05,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:05,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:05,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:05,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:53:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:53:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:53:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 22:53:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-13 22:53:05,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:05,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439259539] [2022-07-13 22:53:05,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439259539] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:05,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14986342] [2022-07-13 22:53:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:05,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:05,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:05,780 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:05,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-13 22:53:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:06,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 1102 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-13 22:53:06,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:06,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:53:06,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:06,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:53:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-13 22:53:06,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:53:06,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14986342] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:06,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:53:06,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 21 [2022-07-13 22:53:06,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743942638] [2022-07-13 22:53:06,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:06,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:53:06,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:06,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:53:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=373, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:53:06,824 INFO L87 Difference]: Start difference. First operand 189 states and 270 transitions. Second operand has 11 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-13 22:53:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:07,061 INFO L93 Difference]: Finished difference Result 319 states and 449 transitions. [2022-07-13 22:53:07,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:53:07,061 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 141 [2022-07-13 22:53:07,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:07,063 INFO L225 Difference]: With dead ends: 319 [2022-07-13 22:53:07,063 INFO L226 Difference]: Without dead ends: 202 [2022-07-13 22:53:07,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:53:07,064 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 54 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:07,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 986 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 71 Invalid, 0 Unknown, 110 Unchecked, 0.2s Time] [2022-07-13 22:53:07,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-07-13 22:53:07,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 197. [2022-07-13 22:53:07,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 134 states have (on average 1.171641791044776) internal successors, (157), 141 states have internal predecessors, (157), 45 states have call successors, (45), 14 states have call predecessors, (45), 17 states have return successors, (78), 44 states have call predecessors, (78), 43 states have call successors, (78) [2022-07-13 22:53:07,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 280 transitions. [2022-07-13 22:53:07,075 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 280 transitions. Word has length 141 [2022-07-13 22:53:07,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:07,077 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 280 transitions. [2022-07-13 22:53:07,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.9) internal successors, (59), 9 states have internal predecessors, (59), 6 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-07-13 22:53:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 280 transitions. [2022-07-13 22:53:07,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-13 22:53:07,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:07,078 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:07,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:07,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:07,299 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:07,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:07,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1307945050, now seen corresponding path program 1 times [2022-07-13 22:53:07,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:07,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464617291] [2022-07-13 22:53:07,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:07,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:07,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:53:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:53:07,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:07,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-13 22:53:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 22:53:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:07,752 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 31 proven. 12 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2022-07-13 22:53:07,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:07,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464617291] [2022-07-13 22:53:07,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464617291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:07,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218436804] [2022-07-13 22:53:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:07,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:07,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:07,755 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:07,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-13 22:53:08,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:08,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-13 22:53:08,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:08,612 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:53:08,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 22:53:08,623 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:53:08,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 22:53:09,187 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 91 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-07-13 22:53:09,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:53:09,726 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 23 proven. 12 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-13 22:53:09,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218436804] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:53:09,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:53:09,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 11] total 41 [2022-07-13 22:53:09,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266794376] [2022-07-13 22:53:09,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:53:09,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-13 22:53:09,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:09,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-13 22:53:09,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2022-07-13 22:53:09,728 INFO L87 Difference]: Start difference. First operand 197 states and 280 transitions. Second operand has 41 states, 40 states have (on average 3.55) internal successors, (142), 35 states have internal predecessors, (142), 16 states have call successors, (38), 4 states have call predecessors, (38), 11 states have return successors, (36), 20 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-13 22:53:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:13,598 INFO L93 Difference]: Finished difference Result 529 states and 842 transitions. [2022-07-13 22:53:13,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-13 22:53:13,598 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.55) internal successors, (142), 35 states have internal predecessors, (142), 16 states have call successors, (38), 4 states have call predecessors, (38), 11 states have return successors, (36), 20 states have call predecessors, (36), 16 states have call successors, (36) Word has length 141 [2022-07-13 22:53:13,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:13,606 INFO L225 Difference]: With dead ends: 529 [2022-07-13 22:53:13,606 INFO L226 Difference]: Without dead ends: 400 [2022-07-13 22:53:13,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1023 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=419, Invalid=4983, Unknown=0, NotChecked=0, Total=5402 [2022-07-13 22:53:13,609 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 280 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 6972 mSolverCounterSat, 287 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 2948 SdHoareTripleChecker+Invalid, 7697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 287 IncrementalHoareTripleChecker+Valid, 6972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 438 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:13,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 2948 Invalid, 7697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [287 Valid, 6972 Invalid, 0 Unknown, 438 Unchecked, 3.0s Time] [2022-07-13 22:53:13,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-07-13 22:53:13,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 222. [2022-07-13 22:53:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 150 states have (on average 1.1533333333333333) internal successors, (173), 155 states have internal predecessors, (173), 50 states have call successors, (50), 18 states have call predecessors, (50), 21 states have return successors, (83), 51 states have call predecessors, (83), 48 states have call successors, (83) [2022-07-13 22:53:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 306 transitions. [2022-07-13 22:53:13,633 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 306 transitions. Word has length 141 [2022-07-13 22:53:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:13,633 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 306 transitions. [2022-07-13 22:53:13,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.55) internal successors, (142), 35 states have internal predecessors, (142), 16 states have call successors, (38), 4 states have call predecessors, (38), 11 states have return successors, (36), 20 states have call predecessors, (36), 16 states have call successors, (36) [2022-07-13 22:53:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 306 transitions. [2022-07-13 22:53:13,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-13 22:53:13,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:13,634 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:13,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-13 22:53:13,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-13 22:53:13,847 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:13,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:13,848 INFO L85 PathProgramCache]: Analyzing trace with hash -47147753, now seen corresponding path program 1 times [2022-07-13 22:53:13,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:13,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580010245] [2022-07-13 22:53:13,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:13,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:13,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:13,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:13,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:13,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:13,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:13,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:13,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:13,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:13,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:13,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:53:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:53:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:53:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:53:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,058 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-13 22:53:14,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:14,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580010245] [2022-07-13 22:53:14,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580010245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:14,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:53:14,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-13 22:53:14,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824964395] [2022-07-13 22:53:14,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:14,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:53:14,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:14,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:53:14,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-13 22:53:14,062 INFO L87 Difference]: Start difference. First operand 222 states and 306 transitions. Second operand has 10 states, 10 states have (on average 6.0) internal successors, (60), 8 states have internal predecessors, (60), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:53:14,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:14,587 INFO L93 Difference]: Finished difference Result 358 states and 501 transitions. [2022-07-13 22:53:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:53:14,588 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 8 states have internal predecessors, (60), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 142 [2022-07-13 22:53:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:14,589 INFO L225 Difference]: With dead ends: 358 [2022-07-13 22:53:14,589 INFO L226 Difference]: Without dead ends: 222 [2022-07-13 22:53:14,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:53:14,590 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 123 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:14,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 445 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:53:14,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-07-13 22:53:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-07-13 22:53:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 150 states have (on average 1.1533333333333333) internal successors, (173), 155 states have internal predecessors, (173), 50 states have call successors, (50), 18 states have call predecessors, (50), 21 states have return successors, (82), 51 states have call predecessors, (82), 48 states have call successors, (82) [2022-07-13 22:53:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 305 transitions. [2022-07-13 22:53:14,604 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 305 transitions. Word has length 142 [2022-07-13 22:53:14,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:14,605 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 305 transitions. [2022-07-13 22:53:14,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.0) internal successors, (60), 8 states have internal predecessors, (60), 5 states have call successors, (15), 4 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:53:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 305 transitions. [2022-07-13 22:53:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-13 22:53:14,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:14,606 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:14,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-13 22:53:14,607 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:14,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:14,607 INFO L85 PathProgramCache]: Analyzing trace with hash -659395979, now seen corresponding path program 1 times [2022-07-13 22:53:14,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:14,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270512713] [2022-07-13 22:53:14,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:14,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:14,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:14,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:14,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:14,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:14,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:53:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:53:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:53:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:53:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-13 22:53:14,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:14,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270512713] [2022-07-13 22:53:14,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270512713] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:14,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617595663] [2022-07-13 22:53:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:14,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:14,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:14,873 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:14,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-13 22:53:15,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:15,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-13 22:53:15,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-13 22:53:15,869 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:53:15,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617595663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:15,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:53:15,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 14 [2022-07-13 22:53:15,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541369177] [2022-07-13 22:53:15,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:15,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:53:15,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:15,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:53:15,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:53:15,870 INFO L87 Difference]: Start difference. First operand 222 states and 305 transitions. Second operand has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:53:16,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:16,064 INFO L93 Difference]: Finished difference Result 395 states and 566 transitions. [2022-07-13 22:53:16,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:53:16,064 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 151 [2022-07-13 22:53:16,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:16,066 INFO L225 Difference]: With dead ends: 395 [2022-07-13 22:53:16,066 INFO L226 Difference]: Without dead ends: 233 [2022-07-13 22:53:16,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2022-07-13 22:53:16,068 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 20 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:16,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 760 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-07-13 22:53:16,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-07-13 22:53:16,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 229. [2022-07-13 22:53:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 156 states have (on average 1.1602564102564104) internal successors, (181), 161 states have internal predecessors, (181), 50 states have call successors, (50), 18 states have call predecessors, (50), 22 states have return successors, (83), 52 states have call predecessors, (83), 48 states have call successors, (83) [2022-07-13 22:53:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 314 transitions. [2022-07-13 22:53:16,082 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 314 transitions. Word has length 151 [2022-07-13 22:53:16,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:16,082 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 314 transitions. [2022-07-13 22:53:16,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.333333333333334) internal successors, (75), 8 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:53:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 314 transitions. [2022-07-13 22:53:16,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-13 22:53:16,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:16,084 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:16,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:16,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-13 22:53:16,307 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:16,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 878944051, now seen corresponding path program 1 times [2022-07-13 22:53:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:16,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531944753] [2022-07-13 22:53:16,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:16,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:53:16,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:53:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:16,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:53:16,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:53:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 27 proven. 8 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-07-13 22:53:16,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:16,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531944753] [2022-07-13 22:53:16,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531944753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:16,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893490338] [2022-07-13 22:53:16,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:16,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:16,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:16,540 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:16,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-13 22:53:17,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-13 22:53:17,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-07-13 22:53:17,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:53:17,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [893490338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:17,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:53:17,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 17 [2022-07-13 22:53:17,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147683388] [2022-07-13 22:53:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:17,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:53:17,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:17,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:53:17,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2022-07-13 22:53:17,507 INFO L87 Difference]: Start difference. First operand 229 states and 314 transitions. Second operand has 11 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:53:17,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:17,592 INFO L93 Difference]: Finished difference Result 448 states and 651 transitions. [2022-07-13 22:53:17,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:53:17,593 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 151 [2022-07-13 22:53:17,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:17,594 INFO L225 Difference]: With dead ends: 448 [2022-07-13 22:53:17,594 INFO L226 Difference]: Without dead ends: 238 [2022-07-13 22:53:17,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2022-07-13 22:53:17,596 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 8 mSDsluCounter, 1269 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1416 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:17,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1416 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 22:53:17,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-07-13 22:53:17,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 233. [2022-07-13 22:53:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 159 states have (on average 1.1572327044025157) internal successors, (184), 164 states have internal predecessors, (184), 50 states have call successors, (50), 18 states have call predecessors, (50), 23 states have return successors, (85), 53 states have call predecessors, (85), 48 states have call successors, (85) [2022-07-13 22:53:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 319 transitions. [2022-07-13 22:53:17,612 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 319 transitions. Word has length 151 [2022-07-13 22:53:17,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:17,612 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 319 transitions. [2022-07-13 22:53:17,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.2) internal successors, (72), 9 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 5 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:53:17,613 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 319 transitions. [2022-07-13 22:53:17,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-13 22:53:17,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:17,614 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:17,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:17,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-13 22:53:17,831 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:17,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:17,832 INFO L85 PathProgramCache]: Analyzing trace with hash 216623027, now seen corresponding path program 1 times [2022-07-13 22:53:17,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:17,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893045479] [2022-07-13 22:53:17,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:17,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:17,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:17,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:17,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:17,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:17,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-13 22:53:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-13 22:53:17,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:17,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:53:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:53:17,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 20 proven. 2 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-07-13 22:53:17,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:17,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893045479] [2022-07-13 22:53:17,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893045479] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:17,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117559552] [2022-07-13 22:53:17,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:17,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:17,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:17,965 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:17,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-13 22:53:18,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:18,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 22:53:18,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:18,831 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2022-07-13 22:53:18,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:53:18,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117559552] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:18,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:53:18,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-07-13 22:53:18,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723627415] [2022-07-13 22:53:18,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:18,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 22:53:18,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:18,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 22:53:18,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 22:53:18,833 INFO L87 Difference]: Start difference. First operand 233 states and 319 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 22:53:18,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:18,853 INFO L93 Difference]: Finished difference Result 439 states and 633 transitions. [2022-07-13 22:53:18,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 22:53:18,853 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 151 [2022-07-13 22:53:18,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:18,854 INFO L225 Difference]: With dead ends: 439 [2022-07-13 22:53:18,854 INFO L226 Difference]: Without dead ends: 225 [2022-07-13 22:53:18,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-13 22:53:18,855 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 2 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:18,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 426 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 22:53:18,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-07-13 22:53:18,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2022-07-13 22:53:18,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 152 states have (on average 1.144736842105263) internal successors, (174), 156 states have internal predecessors, (174), 50 states have call successors, (50), 18 states have call predecessors, (50), 21 states have return successors, (75), 52 states have call predecessors, (75), 48 states have call successors, (75) [2022-07-13 22:53:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 299 transitions. [2022-07-13 22:53:18,905 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 299 transitions. Word has length 151 [2022-07-13 22:53:18,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:18,905 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 299 transitions. [2022-07-13 22:53:18,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 22:53:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 299 transitions. [2022-07-13 22:53:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-13 22:53:18,906 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:18,907 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:18,946 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:19,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:19,147 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:19,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:19,147 INFO L85 PathProgramCache]: Analyzing trace with hash 405010793, now seen corresponding path program 2 times [2022-07-13 22:53:19,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:19,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865398151] [2022-07-13 22:53:19,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:19,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:19,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:19,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:19,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:53:19,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:53:19,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:53:19,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:53:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:19,546 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 37 proven. 18 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-07-13 22:53:19,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:19,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865398151] [2022-07-13 22:53:19,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865398151] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:19,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860578486] [2022-07-13 22:53:19,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:53:19,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:19,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:19,548 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:19,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-13 22:53:20,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-13 22:53:20,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:53:20,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 22:53:20,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:20,353 INFO L356 Elim1Store]: treesize reduction 157, result has 14.2 percent of original size [2022-07-13 22:53:20,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 3 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:53:20,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:20,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:20,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:20,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:20,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:20,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:20,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:53:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2022-07-13 22:53:28,148 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:53:28,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860578486] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:28,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:53:28,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 23 [2022-07-13 22:53:28,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846678174] [2022-07-13 22:53:28,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:28,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:53:28,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:28,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:53:28,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=451, Unknown=2, NotChecked=0, Total=506 [2022-07-13 22:53:28,150 INFO L87 Difference]: Start difference. First operand 224 states and 299 transitions. Second operand has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 22:53:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:28,346 INFO L93 Difference]: Finished difference Result 349 states and 464 transitions. [2022-07-13 22:53:28,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:53:28,347 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 152 [2022-07-13 22:53:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:28,348 INFO L225 Difference]: With dead ends: 349 [2022-07-13 22:53:28,348 INFO L226 Difference]: Without dead ends: 231 [2022-07-13 22:53:28,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=77, Invalid=571, Unknown=2, NotChecked=0, Total=650 [2022-07-13 22:53:28,349 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 26 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:28,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 309 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 68 Unchecked, 0.0s Time] [2022-07-13 22:53:28,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-13 22:53:28,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 220. [2022-07-13 22:53:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 149 states have (on average 1.1409395973154361) internal successors, (170), 152 states have internal predecessors, (170), 50 states have call successors, (50), 18 states have call predecessors, (50), 20 states have return successors, (70), 52 states have call predecessors, (70), 48 states have call successors, (70) [2022-07-13 22:53:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 290 transitions. [2022-07-13 22:53:28,362 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 290 transitions. Word has length 152 [2022-07-13 22:53:28,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:28,363 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 290 transitions. [2022-07-13 22:53:28,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-13 22:53:28,363 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 290 transitions. [2022-07-13 22:53:28,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-13 22:53:28,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:28,364 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:28,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:28,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:28,583 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:28,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:28,584 INFO L85 PathProgramCache]: Analyzing trace with hash 270149221, now seen corresponding path program 1 times [2022-07-13 22:53:28,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:28,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815608280] [2022-07-13 22:53:28,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:28,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:28,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:28,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:28,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:53:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:53:28,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-13 22:53:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-13 22:53:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 39 proven. 9 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-13 22:53:28,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:28,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815608280] [2022-07-13 22:53:28,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815608280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:28,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629715884] [2022-07-13 22:53:28,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:28,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:28,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:28,885 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:28,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-13 22:53:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:29,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 1127 conjuncts, 117 conjunts are in the unsatisfiable core [2022-07-13 22:53:29,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:29,887 INFO L356 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2022-07-13 22:53:29,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 22:53:31,043 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 111 proven. 12 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-13 22:53:31,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:53:33,091 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_aws_linked_list_empty_~list.base_20 Int) (v_aws_linked_list_empty_~list.offset_20 Int)) (= (+ v_aws_linked_list_empty_~list.offset_20 16) (select (select |c_#memory_$Pointer$.offset| v_aws_linked_list_empty_~list.base_20) v_aws_linked_list_empty_~list.offset_20))) (forall ((v_aws_linked_list_empty_~list.base_20 Int) (v_aws_linked_list_empty_~list.offset_20 Int)) (= v_aws_linked_list_empty_~list.base_20 (select (select |c_#memory_$Pointer$.base| v_aws_linked_list_empty_~list.base_20) v_aws_linked_list_empty_~list.offset_20)))) is different from false [2022-07-13 22:53:33,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629715884] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:33,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:53:33,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 28] total 41 [2022-07-13 22:53:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587691025] [2022-07-13 22:53:33,093 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:53:33,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-13 22:53:33,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-13 22:53:33,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1593, Unknown=1, NotChecked=80, Total=1806 [2022-07-13 22:53:33,095 INFO L87 Difference]: Start difference. First operand 220 states and 290 transitions. Second operand has 41 states, 37 states have (on average 4.297297297297297) internal successors, (159), 36 states have internal predecessors, (159), 16 states have call successors, (32), 5 states have call predecessors, (32), 10 states have return successors, (29), 15 states have call predecessors, (29), 16 states have call successors, (29) [2022-07-13 22:53:35,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:35,506 INFO L93 Difference]: Finished difference Result 541 states and 741 transitions. [2022-07-13 22:53:35,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-13 22:53:35,506 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 4.297297297297297) internal successors, (159), 36 states have internal predecessors, (159), 16 states have call successors, (32), 5 states have call predecessors, (32), 10 states have return successors, (29), 15 states have call predecessors, (29), 16 states have call successors, (29) Word has length 152 [2022-07-13 22:53:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:35,508 INFO L225 Difference]: With dead ends: 541 [2022-07-13 22:53:35,508 INFO L226 Difference]: Without dead ends: 350 [2022-07-13 22:53:35,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 189 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1457 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=384, Invalid=5625, Unknown=1, NotChecked=152, Total=6162 [2022-07-13 22:53:35,511 INFO L413 NwaCegarLoop]: 195 mSDtfsCounter, 198 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 2438 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 3444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 2438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 872 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:35,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1958 Invalid, 3444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 2438 Invalid, 0 Unknown, 872 Unchecked, 1.5s Time] [2022-07-13 22:53:35,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-13 22:53:35,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 285. [2022-07-13 22:53:35,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 198 states have (on average 1.1262626262626263) internal successors, (223), 204 states have internal predecessors, (223), 58 states have call successors, (58), 23 states have call predecessors, (58), 28 states have return successors, (84), 60 states have call predecessors, (84), 56 states have call successors, (84) [2022-07-13 22:53:35,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 365 transitions. [2022-07-13 22:53:35,531 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 365 transitions. Word has length 152 [2022-07-13 22:53:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:35,531 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 365 transitions. [2022-07-13 22:53:35,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 4.297297297297297) internal successors, (159), 36 states have internal predecessors, (159), 16 states have call successors, (32), 5 states have call predecessors, (32), 10 states have return successors, (29), 15 states have call predecessors, (29), 16 states have call successors, (29) [2022-07-13 22:53:35,531 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 365 transitions. [2022-07-13 22:53:35,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-13 22:53:35,532 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:35,532 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:35,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:35,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-07-13 22:53:35,754 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:35,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:35,756 INFO L85 PathProgramCache]: Analyzing trace with hash -263457315, now seen corresponding path program 1 times [2022-07-13 22:53:35,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:35,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047861456] [2022-07-13 22:53:35,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:35,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:35,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:36,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:36,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:36,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-13 22:53:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-13 22:53:36,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:36,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-13 22:53:36,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-13 22:53:36,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:53:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-13 22:53:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:36,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 67 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2022-07-13 22:53:36,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:36,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047861456] [2022-07-13 22:53:36,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047861456] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:36,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836845931] [2022-07-13 22:53:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:36,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:36,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:36,420 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:36,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-13 22:53:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:37,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 887 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-13 22:53:37,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:37,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2022-07-13 22:53:37,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,618 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:37,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:53:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 66 proven. 16 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-13 22:53:38,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:53:39,194 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2022-07-13 22:53:39,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836845931] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:39,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:53:39,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [19, 22] total 48 [2022-07-13 22:53:39,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399008521] [2022-07-13 22:53:39,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:39,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 22:53:39,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:39,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 22:53:39,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2125, Unknown=0, NotChecked=0, Total=2256 [2022-07-13 22:53:39,197 INFO L87 Difference]: Start difference. First operand 285 states and 365 transitions. Second operand has 11 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:53:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:39,873 INFO L93 Difference]: Finished difference Result 425 states and 564 transitions. [2022-07-13 22:53:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 22:53:39,874 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 164 [2022-07-13 22:53:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:39,875 INFO L225 Difference]: With dead ends: 425 [2022-07-13 22:53:39,875 INFO L226 Difference]: Without dead ends: 292 [2022-07-13 22:53:39,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=163, Invalid=2593, Unknown=0, NotChecked=0, Total=2756 [2022-07-13 22:53:39,878 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:39,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 856 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-13 22:53:39,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-07-13 22:53:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 286. [2022-07-13 22:53:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 199 states have (on average 1.1256281407035176) internal successors, (224), 205 states have internal predecessors, (224), 58 states have call successors, (58), 23 states have call predecessors, (58), 28 states have return successors, (84), 60 states have call predecessors, (84), 56 states have call successors, (84) [2022-07-13 22:53:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 366 transitions. [2022-07-13 22:53:39,897 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 366 transitions. Word has length 164 [2022-07-13 22:53:39,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:39,898 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 366 transitions. [2022-07-13 22:53:39,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-07-13 22:53:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 366 transitions. [2022-07-13 22:53:39,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-13 22:53:39,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:39,899 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:39,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:40,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-13 22:53:40,121 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:40,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1016981286, now seen corresponding path program 1 times [2022-07-13 22:53:40,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:40,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097663438] [2022-07-13 22:53:40,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:40,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:40,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:40,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:40,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:40,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:40,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:53:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:53:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:53:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:53:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2022-07-13 22:53:40,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:40,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097663438] [2022-07-13 22:53:40,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097663438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:40,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:53:40,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-13 22:53:40,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338240179] [2022-07-13 22:53:40,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:40,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-13 22:53:40,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:40,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-13 22:53:40,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-13 22:53:40,343 INFO L87 Difference]: Start difference. First operand 286 states and 366 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 22:53:41,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:41,050 INFO L93 Difference]: Finished difference Result 434 states and 581 transitions. [2022-07-13 22:53:41,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-13 22:53:41,050 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 153 [2022-07-13 22:53:41,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:41,076 INFO L225 Difference]: With dead ends: 434 [2022-07-13 22:53:41,076 INFO L226 Difference]: Without dead ends: 300 [2022-07-13 22:53:41,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=327, Unknown=0, NotChecked=0, Total=420 [2022-07-13 22:53:41,077 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 122 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:41,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 632 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:53:41,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-07-13 22:53:41,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 289. [2022-07-13 22:53:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 201 states have (on average 1.1243781094527363) internal successors, (226), 208 states have internal predecessors, (226), 58 states have call successors, (58), 23 states have call predecessors, (58), 29 states have return successors, (85), 60 states have call predecessors, (85), 56 states have call successors, (85) [2022-07-13 22:53:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 369 transitions. [2022-07-13 22:53:41,097 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 369 transitions. Word has length 153 [2022-07-13 22:53:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:41,097 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 369 transitions. [2022-07-13 22:53:41,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 3 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-13 22:53:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 369 transitions. [2022-07-13 22:53:41,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-13 22:53:41,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:41,099 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:41,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-13 22:53:41,099 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:41,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash 5864036, now seen corresponding path program 1 times [2022-07-13 22:53:41,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:41,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066120650] [2022-07-13 22:53:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:41,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:41,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-13 22:53:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-13 22:53:41,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-13 22:53:41,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:41,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-13 22:53:41,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-13 22:53:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:53:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-13 22:53:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:41,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:41,292 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2022-07-13 22:53:41,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:41,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066120650] [2022-07-13 22:53:41,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066120650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:41,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:53:41,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-13 22:53:41,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837106752] [2022-07-13 22:53:41,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:41,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-13 22:53:41,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:41,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-13 22:53:41,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-13 22:53:41,294 INFO L87 Difference]: Start difference. First operand 289 states and 369 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-13 22:53:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:41,992 INFO L93 Difference]: Finished difference Result 432 states and 568 transitions. [2022-07-13 22:53:41,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-13 22:53:41,992 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) Word has length 153 [2022-07-13 22:53:41,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:41,994 INFO L225 Difference]: With dead ends: 432 [2022-07-13 22:53:41,994 INFO L226 Difference]: Without dead ends: 295 [2022-07-13 22:53:41,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=462, Unknown=0, NotChecked=0, Total=552 [2022-07-13 22:53:41,995 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 141 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:41,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 601 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-13 22:53:41,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-13 22:53:42,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-07-13 22:53:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 204 states have (on average 1.1225490196078431) internal successors, (229), 211 states have internal predecessors, (229), 58 states have call successors, (58), 23 states have call predecessors, (58), 30 states have return successors, (88), 61 states have call predecessors, (88), 56 states have call successors, (88) [2022-07-13 22:53:42,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 375 transitions. [2022-07-13 22:53:42,013 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 375 transitions. Word has length 153 [2022-07-13 22:53:42,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:42,014 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 375 transitions. [2022-07-13 22:53:42,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 11 states have internal predecessors, (69), 6 states have call successors, (16), 4 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14) [2022-07-13 22:53:42,014 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 375 transitions. [2022-07-13 22:53:42,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-13 22:53:42,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:42,015 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:42,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-13 22:53:42,016 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:42,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:42,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2039789455, now seen corresponding path program 1 times [2022-07-13 22:53:42,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:42,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585287629] [2022-07-13 22:53:42,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:42,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:42,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:42,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:42,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:42,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:53:49,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:53:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:53:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-13 22:53:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-13 22:53:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-13 22:53:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:49,569 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2022-07-13 22:53:49,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:49,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585287629] [2022-07-13 22:53:49,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585287629] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:49,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303059161] [2022-07-13 22:53:49,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:49,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:49,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:49,571 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:49,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-13 22:53:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:50,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 1281 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-13 22:53:50,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:50,691 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-13 22:53:50,771 INFO L356 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2022-07-13 22:53:50,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-13 22:53:50,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:50,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-07-13 22:53:50,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 7 [2022-07-13 22:53:50,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-13 22:53:50,983 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_18766 (Array Int Int)) (v_ArrVal_18767 (Array Int Int)) (v_ArrVal_18764 (Array Int Int)) (v_ArrVal_18765 (Array Int Int)) (ensure_linked_list_is_allocated_~node~0.base Int) (v_ArrVal_18768 (Array Int Int)) (ensure_linked_list_is_allocated_~curr~0.base Int) (v_ArrVal_18769 (Array Int Int)) (v_ArrVal_18770 (Array Int Int)) (v_ArrVal_18763 (Array Int Int))) (and (<= ensure_linked_list_is_allocated_~curr~0.base ensure_linked_list_is_allocated_~node~0.base) (= (store (store (store (store |c_old(#memory_$Pointer$.base)| |c_ensure_linked_list_is_allocated_#in~list.base| v_ArrVal_18764) ensure_linked_list_is_allocated_~node~0.base v_ArrVal_18766) ensure_linked_list_is_allocated_~curr~0.base v_ArrVal_18770) |c_ensure_linked_list_is_allocated_#in~list.base| v_ArrVal_18769) |c_#memory_$Pointer$.base|) (< ensure_linked_list_is_allocated_~node~0.base |c_#StackHeapBarrier|) (= (store (store (store (store |c_old(#memory_$Pointer$.offset)| |c_ensure_linked_list_is_allocated_#in~list.base| v_ArrVal_18765) ensure_linked_list_is_allocated_~node~0.base v_ArrVal_18763) ensure_linked_list_is_allocated_~curr~0.base v_ArrVal_18767) |c_ensure_linked_list_is_allocated_#in~list.base| v_ArrVal_18768) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 22:53:51,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:51,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:51,031 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-13 22:53:51,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 42 [2022-07-13 22:53:51,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:51,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:53:51,057 INFO L356 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-07-13 22:53:51,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 37 [2022-07-13 22:53:51,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:53:51,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 22 treesize of output 13 [2022-07-13 22:53:51,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-13 22:53:51,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 15 treesize of output 10 [2022-07-13 22:53:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 39 proven. 24 refuted. 0 times theorem prover too weak. 109 trivial. 2 not checked. [2022-07-13 22:53:52,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:53:52,249 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ensure_linked_list_is_allocated_~curr~0.base_39 Int) (v_ArrVal_18789 (Array Int Int)) (v_ensure_linked_list_is_allocated_~node~0.base_4 Int) (v_ArrVal_18791 (Array Int Int)) (v_ArrVal_18792 (Array Int Int)) (v_ArrVal_18790 (Array Int Int)) (v_ArrVal_18795 (Array Int Int)) (v_ArrVal_18796 (Array Int Int)) (v_ArrVal_18793 (Array Int Int)) (v_ArrVal_18794 (Array Int Int))) (or (not (<= v_ensure_linked_list_is_allocated_~curr~0.base_39 v_ensure_linked_list_is_allocated_~node~0.base_4)) (not (< v_ensure_linked_list_is_allocated_~node~0.base_4 |c_#StackHeapBarrier|)) (and (= (+ |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.offset| 16) (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#b~0#1.base| v_ArrVal_18792) v_ensure_linked_list_is_allocated_~node~0.base_4 v_ArrVal_18795) v_ensure_linked_list_is_allocated_~curr~0.base_39 v_ArrVal_18791) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#b~0#1.base| v_ArrVal_18789) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.base|) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.offset|)) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#b~0#1.base| v_ArrVal_18793) v_ensure_linked_list_is_allocated_~node~0.base_4 v_ArrVal_18796) v_ensure_linked_list_is_allocated_~curr~0.base_39 v_ArrVal_18790) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#b~0#1.base| v_ArrVal_18794) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.base|) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.offset|) |c_ULTIMATE.start_aws_linked_list_swap_contents_harness_~#a~0#1.base|)))) is different from false [2022-07-13 22:53:52,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303059161] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:52,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 22:53:52,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 26 [2022-07-13 22:53:52,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634503316] [2022-07-13 22:53:52,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 22:53:52,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 22:53:52,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:52,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 22:53:52,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=670, Unknown=4, NotChecked=106, Total=870 [2022-07-13 22:53:52,252 INFO L87 Difference]: Start difference. First operand 293 states and 375 transitions. Second operand has 26 states, 24 states have (on average 4.916666666666667) internal successors, (118), 21 states have internal predecessors, (118), 12 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 12 states have call successors, (25) [2022-07-13 22:53:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:56,593 INFO L93 Difference]: Finished difference Result 699 states and 950 transitions. [2022-07-13 22:53:56,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-13 22:53:56,593 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.916666666666667) internal successors, (118), 21 states have internal predecessors, (118), 12 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 12 states have call successors, (25) Word has length 157 [2022-07-13 22:53:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:56,596 INFO L225 Difference]: With dead ends: 699 [2022-07-13 22:53:56,596 INFO L226 Difference]: Without dead ends: 559 [2022-07-13 22:53:56,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 287 SyntacticMatches, 10 SemanticMatches, 38 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=171, Invalid=1226, Unknown=17, NotChecked=146, Total=1560 [2022-07-13 22:53:56,597 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 149 mSDsluCounter, 1246 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 2079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:56,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 1469 Invalid, 2079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1476 Invalid, 0 Unknown, 454 Unchecked, 2.1s Time] [2022-07-13 22:53:56,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-07-13 22:53:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 410. [2022-07-13 22:53:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 296 states have (on average 1.1047297297297298) internal successors, (327), 307 states have internal predecessors, (327), 71 states have call successors, (71), 31 states have call predecessors, (71), 42 states have return successors, (110), 74 states have call predecessors, (110), 69 states have call successors, (110) [2022-07-13 22:53:56,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 508 transitions. [2022-07-13 22:53:56,632 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 508 transitions. Word has length 157 [2022-07-13 22:53:56,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:56,632 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 508 transitions. [2022-07-13 22:53:56,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.916666666666667) internal successors, (118), 21 states have internal predecessors, (118), 12 states have call successors, (26), 5 states have call predecessors, (26), 7 states have return successors, (25), 13 states have call predecessors, (25), 12 states have call successors, (25) [2022-07-13 22:53:56,633 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 508 transitions. [2022-07-13 22:53:56,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-13 22:53:56,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:56,634 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:56,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:56,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-13 22:53:56,848 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1200072382, now seen corresponding path program 1 times [2022-07-13 22:53:56,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:56,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038424973] [2022-07-13 22:53:56,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:56,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:56,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:53:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:56,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:53:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:56,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:53:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:53:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:56,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:53:56,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:53:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:53:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:56,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-13 22:53:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,032 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-13 22:53:57,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:57,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038424973] [2022-07-13 22:53:57,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038424973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:57,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 22:53:57,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 22:53:57,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062072220] [2022-07-13 22:53:57,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:57,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 22:53:57,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:57,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 22:53:57,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 22:53:57,034 INFO L87 Difference]: Start difference. First operand 410 states and 508 transitions. Second operand has 9 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-13 22:53:57,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:57,443 INFO L93 Difference]: Finished difference Result 420 states and 519 transitions. [2022-07-13 22:53:57,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 22:53:57,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 169 [2022-07-13 22:53:57,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:57,445 INFO L225 Difference]: With dead ends: 420 [2022-07-13 22:53:57,445 INFO L226 Difference]: Without dead ends: 418 [2022-07-13 22:53:57,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-13 22:53:57,446 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 61 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:57,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 532 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 22:53:57,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-13 22:53:57,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2022-07-13 22:53:57,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 299 states have (on average 1.1036789297658862) internal successors, (330), 310 states have internal predecessors, (330), 73 states have call successors, (73), 32 states have call predecessors, (73), 43 states have return successors, (112), 76 states have call predecessors, (112), 71 states have call successors, (112) [2022-07-13 22:53:57,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 515 transitions. [2022-07-13 22:53:57,476 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 515 transitions. Word has length 169 [2022-07-13 22:53:57,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:57,476 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 515 transitions. [2022-07-13 22:53:57,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.75) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2022-07-13 22:53:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 515 transitions. [2022-07-13 22:53:57,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-13 22:53:57,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:57,478 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:57,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-13 22:53:57,479 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:57,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:57,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1360457641, now seen corresponding path program 1 times [2022-07-13 22:53:57,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:57,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377836384] [2022-07-13 22:53:57,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:57,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:53:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:53:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-13 22:53:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-13 22:53:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:53:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:53:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:57,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-13 22:53:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-13 22:53:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:57,787 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 41 proven. 12 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2022-07-13 22:53:57,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:57,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377836384] [2022-07-13 22:53:57,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377836384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:57,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015069790] [2022-07-13 22:53:57,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:57,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:57,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:57,789 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:57,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-13 22:53:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:58,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 1211 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 22:53:58,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:53:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2022-07-13 22:53:58,975 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 22:53:58,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015069790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 22:53:58,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-13 22:53:58,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 22 [2022-07-13 22:53:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059357603] [2022-07-13 22:53:58,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 22:53:58,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 22:53:58,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:53:58,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 22:53:58,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2022-07-13 22:53:58,976 INFO L87 Difference]: Start difference. First operand 416 states and 515 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:53:59,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:53:59,274 INFO L93 Difference]: Finished difference Result 536 states and 677 transitions. [2022-07-13 22:53:59,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 22:53:59,274 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) Word has length 156 [2022-07-13 22:53:59,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:53:59,276 INFO L225 Difference]: With dead ends: 536 [2022-07-13 22:53:59,276 INFO L226 Difference]: Without dead ends: 415 [2022-07-13 22:53:59,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=719, Unknown=0, NotChecked=0, Total=812 [2022-07-13 22:53:59,277 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 182 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-13 22:53:59,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 766 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-13 22:53:59,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-13 22:53:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 403. [2022-07-13 22:53:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 287 states have (on average 1.1045296167247387) internal successors, (317), 298 states have internal predecessors, (317), 73 states have call successors, (73), 31 states have call predecessors, (73), 42 states have return successors, (111), 76 states have call predecessors, (111), 71 states have call successors, (111) [2022-07-13 22:53:59,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 501 transitions. [2022-07-13 22:53:59,305 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 501 transitions. Word has length 156 [2022-07-13 22:53:59,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:53:59,306 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 501 transitions. [2022-07-13 22:53:59,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 9 states have internal predecessors, (63), 5 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 4 states have call successors, (13) [2022-07-13 22:53:59,306 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 501 transitions. [2022-07-13 22:53:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-13 22:53:59,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:53:59,308 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 22:53:59,330 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-13 22:53:59,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:59,522 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:53:59,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:53:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1770630814, now seen corresponding path program 1 times [2022-07-13 22:53:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:53:59,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635512032] [2022-07-13 22:53:59,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:53:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:53:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-13 22:53:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:53:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-13 22:53:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-13 22:53:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-13 22:53:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-13 22:53:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-13 22:53:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:53:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:53:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-13 22:53:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:53:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:53:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:53:59,835 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 56 proven. 4 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-13 22:53:59,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:53:59,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635512032] [2022-07-13 22:53:59,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635512032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:53:59,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288063929] [2022-07-13 22:53:59,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:53:59,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:53:59,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:53:59,844 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:53:59,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-13 22:54:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:00,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-13 22:54:00,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:54:00,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-13 22:54:00,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:00,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2022-07-13 22:54:23,308 WARN L233 SmtUtils]: Spent 10.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-13 22:54:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 107 proven. 4 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-07-13 22:54:23,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 22:54:23,780 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 58 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2022-07-13 22:54:23,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288063929] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 22:54:23,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-13 22:54:23,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 8] total 26 [2022-07-13 22:54:23,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423607803] [2022-07-13 22:54:23,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-13 22:54:23,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 22:54:23,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 22:54:23,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 22:54:23,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=558, Unknown=6, NotChecked=0, Total=650 [2022-07-13 22:54:23,783 INFO L87 Difference]: Start difference. First operand 403 states and 501 transitions. Second operand has 26 states, 24 states have (on average 5.208333333333333) internal successors, (125), 24 states have internal predecessors, (125), 13 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-13 22:54:35,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 22:54:35,425 INFO L93 Difference]: Finished difference Result 623 states and 791 transitions. [2022-07-13 22:54:35,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-13 22:54:35,425 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 5.208333333333333) internal successors, (125), 24 states have internal predecessors, (125), 13 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) Word has length 177 [2022-07-13 22:54:35,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 22:54:35,427 INFO L225 Difference]: With dead ends: 623 [2022-07-13 22:54:35,427 INFO L226 Difference]: Without dead ends: 439 [2022-07-13 22:54:35,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 387 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=257, Invalid=1802, Unknown=11, NotChecked=0, Total=2070 [2022-07-13 22:54:35,429 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 240 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1517 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 910 SdHoareTripleChecker+Invalid, 2204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 562 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 22:54:35,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 910 Invalid, 2204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1517 Invalid, 0 Unknown, 562 Unchecked, 1.1s Time] [2022-07-13 22:54:35,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-07-13 22:54:35,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 426. [2022-07-13 22:54:35,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 309 states have (on average 1.103559870550162) internal successors, (341), 319 states have internal predecessors, (341), 73 states have call successors, (73), 33 states have call predecessors, (73), 43 states have return successors, (104), 76 states have call predecessors, (104), 71 states have call successors, (104) [2022-07-13 22:54:35,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 518 transitions. [2022-07-13 22:54:35,471 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 518 transitions. Word has length 177 [2022-07-13 22:54:35,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 22:54:35,471 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 518 transitions. [2022-07-13 22:54:35,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 5.208333333333333) internal successors, (125), 24 states have internal predecessors, (125), 13 states have call successors, (34), 6 states have call predecessors, (34), 6 states have return successors, (29), 11 states have call predecessors, (29), 12 states have call successors, (29) [2022-07-13 22:54:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 518 transitions. [2022-07-13 22:54:35,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-13 22:54:35,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 22:54:35,473 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-13 22:54:35,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-13 22:54:35,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-13 22:54:35,692 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 22:54:35,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 22:54:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1733917871, now seen corresponding path program 2 times [2022-07-13 22:54:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 22:54:35,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840787959] [2022-07-13 22:54:35,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 22:54:35,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 22:54:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:35,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-13 22:54:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:35,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:54:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:35,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:54:35,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:35,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-07-13 22:54:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:54:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-13 22:54:36,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-13 22:54:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:54:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:54:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-13 22:54:36,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-13 22:54:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-13 22:54:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-13 22:54:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-13 22:54:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-13 22:54:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-13 22:54:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-13 22:54:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 22:54:36,358 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 39 proven. 32 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-07-13 22:54:36,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 22:54:36,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840787959] [2022-07-13 22:54:36,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840787959] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 22:54:36,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681247412] [2022-07-13 22:54:36,359 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 22:54:36,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 22:54:36,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 22:54:36,361 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 22:54:36,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-13 22:54:38,010 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 22:54:38,011 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 22:54:38,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 1336 conjuncts, 140 conjunts are in the unsatisfiable core [2022-07-13 22:54:38,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 22:54:38,035 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:54:38,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-13 22:54:38,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 22:54:38,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 22:54:38,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-07-13 22:54:38,160 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-13 22:54:38,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-13 22:54:38,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 22:54:38,219 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-13 22:54:38,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 36 [2022-07-13 22:54:38,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 22:54:38,236 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-13 22:54:38,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 38 [2022-07-13 22:54:38,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-13 22:54:38,425 INFO L356 Elim1Store]: treesize reduction 100, result has 31.0 percent of original size [2022-07-13 22:54:38,426 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-13 22:54:38,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-13 22:54:38,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-13 22:54:38,652 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#memory_$Pointer$.base_153| input size 67 context size 67 output size 67 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:427) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:182) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:164) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:152) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:764) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:725) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:643) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:335) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 22:54:38,655 INFO L158 Benchmark]: Toolchain (without parser) took 131569.59ms. Allocated memory was 148.9MB in the beginning and 752.9MB in the end (delta: 604.0MB). Free memory was 112.1MB in the beginning and 304.3MB in the end (delta: -192.2MB). Peak memory consumption was 411.9MB. Max. memory is 16.1GB. [2022-07-13 22:54:38,655 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:54:38,655 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1217.40ms. Allocated memory is still 148.9MB. Free memory was 112.1MB in the beginning and 67.6MB in the end (delta: 44.5MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. [2022-07-13 22:54:38,655 INFO L158 Benchmark]: Boogie Procedure Inliner took 147.56ms. Allocated memory is still 148.9MB. Free memory was 67.6MB in the beginning and 106.9MB in the end (delta: -39.3MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-07-13 22:54:38,655 INFO L158 Benchmark]: Boogie Preprocessor took 53.21ms. Allocated memory is still 148.9MB. Free memory was 106.9MB in the beginning and 103.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 22:54:38,655 INFO L158 Benchmark]: RCFGBuilder took 588.58ms. Allocated memory is still 148.9MB. Free memory was 103.5MB in the beginning and 71.2MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2022-07-13 22:54:38,655 INFO L158 Benchmark]: TraceAbstraction took 129547.06ms. Allocated memory was 148.9MB in the beginning and 752.9MB in the end (delta: 604.0MB). Free memory was 70.7MB in the beginning and 304.3MB in the end (delta: -233.6MB). Peak memory consumption was 372.5MB. Max. memory is 16.1GB. [2022-07-13 22:54:38,656 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1217.40ms. Allocated memory is still 148.9MB. Free memory was 112.1MB in the beginning and 67.6MB in the end (delta: 44.5MB). Peak memory consumption was 67.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 147.56ms. Allocated memory is still 148.9MB. Free memory was 67.6MB in the beginning and 106.9MB in the end (delta: -39.3MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.21ms. Allocated memory is still 148.9MB. Free memory was 106.9MB in the beginning and 103.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 588.58ms. Allocated memory is still 148.9MB. Free memory was 103.5MB in the beginning and 71.2MB in the end (delta: 32.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 129547.06ms. Allocated memory was 148.9MB in the beginning and 752.9MB in the end (delta: 604.0MB). Free memory was 70.7MB in the beginning and 304.3MB in the end (delta: -233.6MB). Peak memory consumption was 372.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#memory_$Pointer$.base_153| input size 67 context size 67 output size 67 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_153| input size 67 context size 67 output size 67: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:364) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-13 22:54:38,709 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/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 ../sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --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 fab5c58d108ab0116c19af669265df6088034967e28562e9e7d2713e6ada683d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 22:54:40,446 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 22:54:40,449 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 22:54:40,497 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 22:54:40,498 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 22:54:40,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 22:54:40,502 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 22:54:40,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 22:54:40,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 22:54:40,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 22:54:40,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 22:54:40,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 22:54:40,512 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 22:54:40,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 22:54:40,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 22:54:40,517 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 22:54:40,518 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 22:54:40,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 22:54:40,524 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 22:54:40,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 22:54:40,528 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 22:54:40,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 22:54:40,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 22:54:40,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 22:54:40,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 22:54:40,535 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 22:54:40,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 22:54:40,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 22:54:40,537 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 22:54:40,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 22:54:40,538 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 22:54:40,538 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 22:54:40,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 22:54:40,540 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 22:54:40,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 22:54:40,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 22:54:40,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 22:54:40,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 22:54:40,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 22:54:40,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 22:54:40,543 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 22:54:40,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 22:54:40,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-13 22:54:40,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 22:54:40,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 22:54:40,574 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 22:54:40,574 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 22:54:40,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 22:54:40,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 22:54:40,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 22:54:40,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 22:54:40,575 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 22:54:40,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 22:54:40,576 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 22:54:40,576 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 22:54:40,576 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 22:54:40,577 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 22:54:40,577 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 22:54:40,577 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 22:54:40,577 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 22:54:40,577 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 22:54:40,577 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 22:54:40,577 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 22:54:40,578 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 22:54:40,578 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 22:54:40,578 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 22:54:40,578 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 22:54:40,578 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 22:54:40,578 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 22:54:40,578 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 22:54:40,579 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 22:54:40,579 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 22:54:40,579 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 22:54:40,579 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 22:54:40,579 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 22:54:40,579 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 22:54:40,579 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.graphml 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 -> fab5c58d108ab0116c19af669265df6088034967e28562e9e7d2713e6ada683d [2022-07-13 22:54:40,863 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 22:54:40,883 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 22:54:40,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 22:54:40,886 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 22:54:40,886 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 22:54:40,887 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i [2022-07-13 22:54:40,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42d60e980/d9c3222f0be94c9988b94fc7422e0f0a/FLAG17ebdd277 [2022-07-13 22:54:41,431 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 22:54:41,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i [2022-07-13 22:54:41,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42d60e980/d9c3222f0be94c9988b94fc7422e0f0a/FLAG17ebdd277 [2022-07-13 22:54:41,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42d60e980/d9c3222f0be94c9988b94fc7422e0f0a [2022-07-13 22:54:41,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 22:54:41,996 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 22:54:41,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 22:54:41,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 22:54:42,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 22:54:42,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:54:41" (1/1) ... [2022-07-13 22:54:42,009 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25942bcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 10:54:42, skipping insertion in model container [2022-07-13 22:54:42,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 10:54:41" (1/1) ... [2022-07-13 22:54:42,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 22:54:42,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 22:54:42,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i[4503,4516] [2022-07-13 22:54:42,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_swap_contents_harness.i[4563,4576] [2022-07-13 22:54:42,735 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,737 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,738 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,738 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,739 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,749 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,752 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,754 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,755 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,757 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,758 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,759 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,760 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-13 22:54:42,969 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-13 22:54:42,971 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-13 22:54:42,971 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-13 22:54:42,972 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-13 22:54:42,973 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-13 22:54:42,974 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-13 22:54:42,974 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-13 22:54:42,974 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-13 22:54:42,975 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-13 22:54:42,980 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-13 22:54:43,089 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-13 22:54:43,112 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.ArithmeticException: BigInteger out of int range at java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1009) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1384) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:249) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.translateInitializer(CHandler.java:2978) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.handleIASTDeclarator(CHandler.java:2836) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2138) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:143) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1135) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:211) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1081) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1470) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3276) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2361) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-13 22:54:43,118 INFO L158 Benchmark]: Toolchain (without parser) took 1121.20ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 28.2MB in the beginning and 44.8MB in the end (delta: -16.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-07-13 22:54:43,119 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 42.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 22:54:43,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1119.55ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 28.0MB in the beginning and 44.8MB in the end (delta: -16.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-07-13 22:54:43,121 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.8MB in the beginning and 38.7MB in the end (delta: 42.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1119.55ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 28.0MB in the beginning and 44.8MB in the end (delta: -16.8MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: ArithmeticException: BigInteger out of int range: java.base/java.math.BigInteger.intValueExact(BigInteger.java:4784) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of int range