./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 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_hash_table_find_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 b2aa49e297f60cfce052f243c4868c3f21a4b7a15679d0734b9f9fae5c35ea17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:09:53,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:09:53,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:09:53,078 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:09:53,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:09:53,080 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:09:53,081 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:09:53,083 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:09:53,084 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:09:53,085 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:09:53,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:09:53,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:09:53,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:09:53,089 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:09:53,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:09:53,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:09:53,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:09:53,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:09:53,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:09:53,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:09:53,098 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:09:53,099 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:09:53,100 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:09:53,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:09:53,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:09:53,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:09:53,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:09:53,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:09:53,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:09:53,108 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:09:53,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:09:53,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:09:53,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:09:53,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:09:53,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:09:53,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:09:53,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:09:53,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:09:53,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:09:53,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:09:53,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:09:53,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:09:53,118 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:09:53,146 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:09:53,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:09:53,147 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:09:53,147 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:09:53,148 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:09:53,148 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:09:53,149 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:09:53,149 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:09:53,149 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:09:53,150 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:09:53,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:09:53,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:09:53,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:09:53,151 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:09:53,151 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:09:53,151 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:09:53,152 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:09:53,152 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:09:53,152 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:09:53,152 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:09:53,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:09:53,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:09:53,153 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:09:53,153 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:09:53,153 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:09:53,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:09:53,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:09:53,154 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:09:53,154 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:09:53,154 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:09:53,155 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 -> b2aa49e297f60cfce052f243c4868c3f21a4b7a15679d0734b9f9fae5c35ea17 [2022-07-19 22:09:53,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:09:53,452 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:09:53,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:09:53,456 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:09:53,457 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:09:53,458 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i [2022-07-19 22:09:53,522 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac92c207/c83b1e7674644781a8a157085ba44266/FLAGd9f70b97c [2022-07-19 22:09:54,321 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:09:54,321 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i [2022-07-19 22:09:54,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac92c207/c83b1e7674644781a8a157085ba44266/FLAGd9f70b97c [2022-07-19 22:09:54,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fac92c207/c83b1e7674644781a8a157085ba44266 [2022-07-19 22:09:54,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:09:54,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:09:54,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:09:54,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:09:54,837 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:09:54,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:09:54" (1/1) ... [2022-07-19 22:09:54,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cce5b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:54, skipping insertion in model container [2022-07-19 22:09:54,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:09:54" (1/1) ... [2022-07-19 22:09:54,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:09:54,940 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:09:55,222 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_hash_table_find_harness.i[4493,4506] [2022-07-19 22:09:55,232 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_hash_table_find_harness.i[4553,4566] [2022-07-19 22:09:56,187 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,187 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,188 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,189 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,190 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,207 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,208 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,210 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,210 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,212 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,213 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,214 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,214 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:56,616 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:09:56,619 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:09:56,621 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:09:56,623 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:09:56,624 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:09:56,625 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:09:56,626 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:09:56,626 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:09:56,628 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:09:56,640 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:09:56,786 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:09:57,113 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,114 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,142 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,144 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,151 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,151 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,171 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,172 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,173 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,174 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,174 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,174 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,175 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:09:57,265 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:09:57,289 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_hash_table_find_harness.i[4493,4506] [2022-07-19 22:09:57,290 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_hash_table_find_harness.i[4553,4566] [2022-07-19 22:09:57,329 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,330 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,330 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,331 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,331 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,336 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,336 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,337 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,337 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,338 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,338 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,338 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,339 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,367 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:09:57,368 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:09:57,368 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:09:57,369 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:09:57,369 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:09:57,370 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:09:57,372 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:09:57,373 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:09:57,373 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:09:57,374 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:09:57,405 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:09:57,507 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,507 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,512 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,513 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,515 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,515 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,526 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,527 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,527 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,527 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,528 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,529 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,529 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:09:57,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:09:57,789 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:09:57,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57 WrapperNode [2022-07-19 22:09:57,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:09:57,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:09:57,792 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:09:57,792 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:09:57,797 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (1/1) ... [2022-07-19 22:09:57,905 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (1/1) ... [2022-07-19 22:09:57,976 INFO L137 Inliner]: procedures = 774, calls = 2455, calls flagged for inlining = 69, calls inlined = 20, statements flattened = 838 [2022-07-19 22:09:57,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:09:57,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:09:57,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:09:57,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:09:57,994 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (1/1) ... [2022-07-19 22:09:57,994 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (1/1) ... [2022-07-19 22:09:58,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (1/1) ... [2022-07-19 22:09:58,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (1/1) ... [2022-07-19 22:09:58,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (1/1) ... [2022-07-19 22:09:58,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (1/1) ... [2022-07-19 22:09:58,080 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (1/1) ... [2022-07-19 22:09:58,102 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:09:58,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:09:58,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:09:58,110 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:09:58,111 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (1/1) ... [2022-07-19 22:09:58,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:09:58,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:09:58,145 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-19 22:09:58,167 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-19 22:09:58,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-19 22:09:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-19 22:09:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-19 22:09:58,180 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-19 22:09:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:09:58,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:09:58,180 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-19 22:09:58,181 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-19 22:09:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-19 22:09:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:09:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:09:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:09:58,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:09:58,181 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-19 22:09:58,182 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-19 22:09:58,182 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-19 22:09:58,182 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-19 22:09:58,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:09:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-19 22:09:58,183 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-19 22:09:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:09:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-19 22:09:58,183 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-19 22:09:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_find [2022-07-19 22:09:58,184 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_find [2022-07-19 22:09:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-19 22:09:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2022-07-19 22:09:58,184 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2022-07-19 22:09:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-19 22:09:58,185 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-19 22:09:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2022-07-19 22:09:58,185 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2022-07-19 22:09:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-07-19 22:09:58,185 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-07-19 22:09:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:09:58,185 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-19 22:09:58,186 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-19 22:09:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-07-19 22:09:58,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-07-19 22:09:58,186 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2022-07-19 22:09:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2022-07-19 22:09:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2022-07-19 22:09:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2022-07-19 22:09:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:09:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:09:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-19 22:09:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-19 22:09:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:09:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-19 22:09:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-19 22:09:58,187 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-19 22:09:58,187 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-19 22:09:58,188 INFO L130 BoogieDeclarations]: Found specification of procedure uninterpreted_equals [2022-07-19 22:09:58,188 INFO L138 BoogieDeclarations]: Found implementation of procedure uninterpreted_equals [2022-07-19 22:09:58,188 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 22:09:58,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-19 22:09:58,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:09:58,532 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:09:58,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:09:58,700 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2022-07-19 22:09:58,744 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2022-07-19 22:09:58,962 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !true; [2022-07-19 22:09:59,489 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:09:59,497 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:09:59,497 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-07-19 22:09:59,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:09:59 BoogieIcfgContainer [2022-07-19 22:09:59,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:09:59,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:09:59,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:09:59,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:09:59,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:09:54" (1/3) ... [2022-07-19 22:09:59,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6d983d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:09:59, skipping insertion in model container [2022-07-19 22:09:59,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:09:57" (2/3) ... [2022-07-19 22:09:59,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f6d983d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:09:59, skipping insertion in model container [2022-07-19 22:09:59,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:09:59" (3/3) ... [2022-07-19 22:09:59,508 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_find_harness.i [2022-07-19 22:09:59,522 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:09:59,522 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:09:59,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:09:59,589 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@951d4d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20365bf8 [2022-07-19 22:09:59,589 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:09:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 157 states have (on average 1.2101910828025477) internal successors, (190), 155 states have internal predecessors, (190), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2022-07-19 22:09:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-19 22:09:59,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:09:59,618 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:09:59,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:09:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:09:59,625 INFO L85 PathProgramCache]: Analyzing trace with hash 2109277801, now seen corresponding path program 1 times [2022-07-19 22:09:59,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:09:59,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476820620] [2022-07-19 22:09:59,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:09:59,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:00,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:00,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:00,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476820620] [2022-07-19 22:10:00,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-19 22:10:00,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782847426] [2022-07-19 22:10:00,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:00,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:00,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:00,391 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-19 22:10:00,411 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-19 22:10:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:01,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 2687 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-19 22:10:01,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:01,089 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2022-07-19 22:10:01,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:01,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782847426] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:01,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:01,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 22:10:01,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476205028] [2022-07-19 22:10:01,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:01,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 22:10:01,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:01,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 22:10:01,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 22:10:01,133 INFO L87 Difference]: Start difference. First operand has 246 states, 157 states have (on average 1.2101910828025477) internal successors, (190), 155 states have internal predecessors, (190), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-19 22:10:01,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:01,207 INFO L93 Difference]: Finished difference Result 486 states and 686 transitions. [2022-07-19 22:10:01,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 22:10:01,209 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 182 [2022-07-19 22:10:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:01,218 INFO L225 Difference]: With dead ends: 486 [2022-07-19 22:10:01,218 INFO L226 Difference]: Without dead ends: 239 [2022-07-19 22:10:01,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 193 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-19 22:10:01,227 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:01,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:10:01,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-19 22:10:01,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2022-07-19 22:10:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 148 states have (on average 1.195945945945946) internal successors, (177), 149 states have internal predecessors, (177), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-07-19 22:10:01,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 312 transitions. [2022-07-19 22:10:01,312 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 312 transitions. Word has length 182 [2022-07-19 22:10:01,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:01,313 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 312 transitions. [2022-07-19 22:10:01,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-19 22:10:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 312 transitions. [2022-07-19 22:10:01,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-19 22:10:01,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:01,318 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:01,351 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-19 22:10:01,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-19 22:10:01,537 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:01,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1716640621, now seen corresponding path program 1 times [2022-07-19 22:10:01,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:01,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909578642] [2022-07-19 22:10:01,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:01,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:01,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:10:01,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665692348] [2022-07-19 22:10:01,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:01,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:01,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:01,684 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-19 22:10:01,686 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-19 22:10:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:02,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 2687 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-19 22:10:02,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:02,454 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-07-19 22:10:02,454 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:02,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909578642] [2022-07-19 22:10:02,457 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:10:02,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665692348] [2022-07-19 22:10:02,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665692348] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:02,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:02,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:10:02,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100177395] [2022-07-19 22:10:02,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:02,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:10:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:02,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:10:02,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:10:02,469 INFO L87 Difference]: Start difference. First operand 239 states and 312 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-19 22:10:02,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:02,714 INFO L93 Difference]: Finished difference Result 464 states and 608 transitions. [2022-07-19 22:10:02,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:10:02,714 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 182 [2022-07-19 22:10:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:02,721 INFO L225 Difference]: With dead ends: 464 [2022-07-19 22:10:02,721 INFO L226 Difference]: Without dead ends: 246 [2022-07-19 22:10:02,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:10:02,724 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 325 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:02,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1035 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:10:02,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-19 22:10:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2022-07-19 22:10:02,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 153 states have (on average 1.196078431372549) internal successors, (183), 155 states have internal predecessors, (183), 69 states have call successors, (69), 22 states have call predecessors, (69), 23 states have return successors, (70), 68 states have call predecessors, (70), 68 states have call successors, (70) [2022-07-19 22:10:02,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 322 transitions. [2022-07-19 22:10:02,747 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 322 transitions. Word has length 182 [2022-07-19 22:10:02,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:02,748 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 322 transitions. [2022-07-19 22:10:02,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 3 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-19 22:10:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 322 transitions. [2022-07-19 22:10:02,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-19 22:10:02,756 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:02,756 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:02,787 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-19 22:10:02,976 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,SelfDestructingSolverStorable1 [2022-07-19 22:10:02,977 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash 421077933, now seen corresponding path program 1 times [2022-07-19 22:10:02,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:02,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660722996] [2022-07-19 22:10:02,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:02,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:03,066 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:10:03,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [604552082] [2022-07-19 22:10:03,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:03,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:03,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:03,069 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-19 22:10:03,070 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-19 22:10:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:03,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 2697 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-19 22:10:03,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2022-07-19 22:10:03,748 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:03,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:03,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660722996] [2022-07-19 22:10:03,748 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:10:03,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604552082] [2022-07-19 22:10:03,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604552082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:03,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:03,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:10:03,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846247465] [2022-07-19 22:10:03,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:03,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:10:03,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:03,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:10:03,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:10:03,751 INFO L87 Difference]: Start difference. First operand 246 states and 322 transitions. Second operand has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-19 22:10:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:04,073 INFO L93 Difference]: Finished difference Result 404 states and 531 transitions. [2022-07-19 22:10:04,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:10:04,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 182 [2022-07-19 22:10:04,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:04,077 INFO L225 Difference]: With dead ends: 404 [2022-07-19 22:10:04,077 INFO L226 Difference]: Without dead ends: 239 [2022-07-19 22:10:04,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2022-07-19 22:10:04,079 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 321 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:04,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1509 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:10:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-07-19 22:10:04,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2022-07-19 22:10:04,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 148 states have (on average 1.1891891891891893) internal successors, (176), 149 states have internal predecessors, (176), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (67), 67 states have call predecessors, (67), 67 states have call successors, (67) [2022-07-19 22:10:04,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 311 transitions. [2022-07-19 22:10:04,098 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 311 transitions. Word has length 182 [2022-07-19 22:10:04,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:04,099 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 311 transitions. [2022-07-19 22:10:04,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 4 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2022-07-19 22:10:04,100 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 311 transitions. [2022-07-19 22:10:04,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-19 22:10:04,101 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:04,102 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:04,131 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-19 22:10:04,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:04,320 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:04,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:04,320 INFO L85 PathProgramCache]: Analyzing trace with hash -238453589, now seen corresponding path program 1 times [2022-07-19 22:10:04,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:04,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266152929] [2022-07-19 22:10:04,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:04,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:04,393 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-19 22:10:04,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1655397108] [2022-07-19 22:10:04,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:04,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:04,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:04,396 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-19 22:10:04,402 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-19 22:10:04,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:04,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 2702 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-19 22:10:04,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2022-07-19 22:10:04,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:04,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:04,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266152929] [2022-07-19 22:10:04,983 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-19 22:10:04,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655397108] [2022-07-19 22:10:04,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655397108] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:04,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:04,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:10:04,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560219239] [2022-07-19 22:10:04,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:04,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:10:04,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:04,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:10:04,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:10:04,986 INFO L87 Difference]: Start difference. First operand 239 states and 311 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-19 22:10:05,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:05,018 INFO L93 Difference]: Finished difference Result 474 states and 616 transitions. [2022-07-19 22:10:05,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:10:05,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 182 [2022-07-19 22:10:05,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:05,022 INFO L225 Difference]: With dead ends: 474 [2022-07-19 22:10:05,023 INFO L226 Difference]: Without dead ends: 244 [2022-07-19 22:10:05,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 178 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-19 22:10:05,024 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 2 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:05,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1227 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:10:05,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-07-19 22:10:05,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2022-07-19 22:10:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 152 states have (on average 1.1842105263157894) internal successors, (180), 153 states have internal predecessors, (180), 68 states have call successors, (68), 22 states have call predecessors, (68), 23 states have return successors, (68), 68 states have call predecessors, (68), 67 states have call successors, (68) [2022-07-19 22:10:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 316 transitions. [2022-07-19 22:10:05,040 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 316 transitions. Word has length 182 [2022-07-19 22:10:05,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:05,041 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 316 transitions. [2022-07-19 22:10:05,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (31), 2 states have call predecessors, (31), 3 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-19 22:10:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 316 transitions. [2022-07-19 22:10:05,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-07-19 22:10:05,043 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:05,044 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:05,075 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-19 22:10:05,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:05,259 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:05,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:05,260 INFO L85 PathProgramCache]: Analyzing trace with hash -168770197, now seen corresponding path program 1 times [2022-07-19 22:10:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:05,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605935348] [2022-07-19 22:10:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:05,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:05,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:05,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-19 22:10:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:10:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:10:05,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-19 22:10:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:10:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:05,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:05,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-19 22:10:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:06,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-19 22:10:06,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:06,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-19 22:10:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:06,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:10:06,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:06,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-19 22:10:06,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:06,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-19 22:10:06,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:06,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 22:10:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:06,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-19 22:10:06,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:06,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-19 22:10:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 397 trivial. 0 not checked. [2022-07-19 22:10:06,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:06,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605935348] [2022-07-19 22:10:06,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605935348] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:10:06,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576653381] [2022-07-19 22:10:06,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:06,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:06,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:06,111 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-19 22:10:06,113 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-19 22:10:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:06,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 2710 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-19 22:10:06,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:06,819 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 11 treesize of output 7 [2022-07-19 22:10:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 211 trivial. 0 not checked. [2022-07-19 22:10:07,042 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:07,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576653381] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:07,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:10:07,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [13] total 21 [2022-07-19 22:10:07,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805494364] [2022-07-19 22:10:07,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:07,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:10:07,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:07,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:10:07,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2022-07-19 22:10:07,044 INFO L87 Difference]: Start difference. First operand 244 states and 316 transitions. Second operand has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 9 states have internal predecessors, (89), 4 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2022-07-19 22:10:07,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:07,158 INFO L93 Difference]: Finished difference Result 474 states and 611 transitions. [2022-07-19 22:10:07,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:10:07,159 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 9 states have internal predecessors, (89), 4 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 194 [2022-07-19 22:10:07,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:07,161 INFO L225 Difference]: With dead ends: 474 [2022-07-19 22:10:07,161 INFO L226 Difference]: Without dead ends: 248 [2022-07-19 22:10:07,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:10:07,163 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 35 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1662 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:07,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1662 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 79 Unchecked, 0.1s Time] [2022-07-19 22:10:07,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-19 22:10:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2022-07-19 22:10:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 156 states have (on average 1.1794871794871795) internal successors, (184), 156 states have internal predecessors, (184), 68 states have call successors, (68), 23 states have call predecessors, (68), 23 states have return successors, (68), 68 states have call predecessors, (68), 67 states have call successors, (68) [2022-07-19 22:10:07,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 320 transitions. [2022-07-19 22:10:07,177 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 320 transitions. Word has length 194 [2022-07-19 22:10:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:07,177 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 320 transitions. [2022-07-19 22:10:07,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.090909090909092) internal successors, (89), 9 states have internal predecessors, (89), 4 states have call successors, (33), 3 states have call predecessors, (33), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2022-07-19 22:10:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 320 transitions. [2022-07-19 22:10:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-07-19 22:10:07,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:07,180 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:07,219 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-19 22:10:07,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:07,392 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:07,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:07,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1760895517, now seen corresponding path program 1 times [2022-07-19 22:10:07,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:07,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530464214] [2022-07-19 22:10:07,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:07,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:07,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:07,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-19 22:10:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-19 22:10:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-19 22:10:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:10:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-19 22:10:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-19 22:10:07,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-19 22:10:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-19 22:10:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-19 22:10:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-19 22:10:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-19 22:10:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-19 22:10:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-19 22:10:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-19 22:10:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:07,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 22:10:07,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,006 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-07-19 22:10:08,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:08,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530464214] [2022-07-19 22:10:08,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530464214] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:10:08,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620173999] [2022-07-19 22:10:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:08,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:08,008 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-19 22:10:08,010 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-19 22:10:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:08,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 2734 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-19 22:10:08,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:09,500 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= 0 (select (select |c_#memory_$Pointer$.offset| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset)))) (exists ((aws_hash_table_is_valid_~map.base Int) (aws_hash_table_is_valid_~map.offset Int)) (not (= (select (select |c_#memory_$Pointer$.base| aws_hash_table_is_valid_~map.base) aws_hash_table_is_valid_~map.offset) 0)))) is different from true [2022-07-19 22:10:15,478 INFO L134 CoverageAnalysis]: Checked inductivity of 413 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-19 22:10:15,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:15,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620173999] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:15,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:10:15,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-07-19 22:10:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568090131] [2022-07-19 22:10:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:15,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:10:15,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:15,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:10:15,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-07-19 22:10:15,481 INFO L87 Difference]: Start difference. First operand 248 states and 320 transitions. Second operand has 8 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-19 22:10:15,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:15,687 INFO L93 Difference]: Finished difference Result 476 states and 619 transitions. [2022-07-19 22:10:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:10:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) Word has length 200 [2022-07-19 22:10:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:15,689 INFO L225 Difference]: With dead ends: 476 [2022-07-19 22:10:15,689 INFO L226 Difference]: Without dead ends: 251 [2022-07-19 22:10:15,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2022-07-19 22:10:15,691 INFO L413 NwaCegarLoop]: 306 mSDtfsCounter, 5 mSDsluCounter, 1362 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1668 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 429 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:15,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1668 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 429 Unchecked, 0.1s Time] [2022-07-19 22:10:15,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-19 22:10:15,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2022-07-19 22:10:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 158 states have (on average 1.1772151898734178) internal successors, (186), 157 states have internal predecessors, (186), 68 states have call successors, (68), 24 states have call predecessors, (68), 23 states have return successors, (68), 68 states have call predecessors, (68), 67 states have call successors, (68) [2022-07-19 22:10:15,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 322 transitions. [2022-07-19 22:10:15,704 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 322 transitions. Word has length 200 [2022-07-19 22:10:15,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:15,705 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 322 transitions. [2022-07-19 22:10:15,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.0) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (34), 3 states have call predecessors, (34), 3 states have return successors, (31), 2 states have call predecessors, (31), 3 states have call successors, (31) [2022-07-19 22:10:15,705 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 322 transitions. [2022-07-19 22:10:15,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-19 22:10:15,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:15,708 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:15,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-19 22:10:15,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:15,936 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:15,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:15,936 INFO L85 PathProgramCache]: Analyzing trace with hash -661330404, now seen corresponding path program 1 times [2022-07-19 22:10:15,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:15,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445075901] [2022-07-19 22:10:15,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:15,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:16,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:16,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:16,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:16,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:16,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:10:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:10:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:10:16,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:10:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 22:10:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:10:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:10:16,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:10:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 22:10:16,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 22:10:16,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 22:10:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-19 22:10:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2022-07-19 22:10:16,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:16,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445075901] [2022-07-19 22:10:16,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445075901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:16,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:16,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-19 22:10:16,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996604150] [2022-07-19 22:10:16,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:16,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:10:16,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:16,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:10:16,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-19 22:10:16,609 INFO L87 Difference]: Start difference. First operand 250 states and 322 transitions. Second operand has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-19 22:10:17,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:17,629 INFO L93 Difference]: Finished difference Result 408 states and 531 transitions. [2022-07-19 22:10:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:10:17,629 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) Word has length 205 [2022-07-19 22:10:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:17,632 INFO L225 Difference]: With dead ends: 408 [2022-07-19 22:10:17,632 INFO L226 Difference]: Without dead ends: 262 [2022-07-19 22:10:17,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:10:17,634 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 332 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 1085 mSolverCounterSat, 291 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 1376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 291 IncrementalHoareTripleChecker+Valid, 1085 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:17,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 701 Invalid, 1376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [291 Valid, 1085 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-19 22:10:17,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2022-07-19 22:10:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 252. [2022-07-19 22:10:17,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 159 states have (on average 1.1761006289308176) internal successors, (187), 159 states have internal predecessors, (187), 68 states have call successors, (68), 24 states have call predecessors, (68), 24 states have return successors, (70), 68 states have call predecessors, (70), 67 states have call successors, (70) [2022-07-19 22:10:17,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 325 transitions. [2022-07-19 22:10:17,652 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 325 transitions. Word has length 205 [2022-07-19 22:10:17,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:17,654 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 325 transitions. [2022-07-19 22:10:17,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (32), 5 states have call predecessors, (32), 3 states have return successors, (29), 3 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-19 22:10:17,654 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 325 transitions. [2022-07-19 22:10:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-19 22:10:17,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:17,656 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:17,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 22:10:17,657 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1796534111, now seen corresponding path program 1 times [2022-07-19 22:10:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:17,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490731180] [2022-07-19 22:10:17,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:17,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:18,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:18,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:10:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:10:18,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:10:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:18,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:10:18,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 22:10:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:10:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:10:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:10:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-19 22:10:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-19 22:10:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-19 22:10:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:18,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-19 22:10:18,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:18,548 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2022-07-19 22:10:18,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:18,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490731180] [2022-07-19 22:10:18,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490731180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:18,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:10:18,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-19 22:10:18,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505021528] [2022-07-19 22:10:18,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:18,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-19 22:10:18,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:18,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-19 22:10:18,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-19 22:10:18,551 INFO L87 Difference]: Start difference. First operand 252 states and 325 transitions. Second operand has 16 states, 14 states have (on average 5.5) internal successors, (77), 12 states have internal predecessors, (77), 6 states have call successors, (33), 6 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 5 states have call successors, (30) [2022-07-19 22:10:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:20,483 INFO L93 Difference]: Finished difference Result 424 states and 554 transitions. [2022-07-19 22:10:20,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-19 22:10:20,484 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 5.5) internal successors, (77), 12 states have internal predecessors, (77), 6 states have call successors, (33), 6 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 5 states have call successors, (30) Word has length 210 [2022-07-19 22:10:20,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:20,487 INFO L225 Difference]: With dead ends: 424 [2022-07-19 22:10:20,487 INFO L226 Difference]: Without dead ends: 269 [2022-07-19 22:10:20,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2022-07-19 22:10:20,488 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 372 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:20,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1223 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-19 22:10:20,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-19 22:10:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 255. [2022-07-19 22:10:20,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 161 states have (on average 1.173913043478261) internal successors, (189), 162 states have internal predecessors, (189), 68 states have call successors, (68), 24 states have call predecessors, (68), 25 states have return successors, (73), 68 states have call predecessors, (73), 67 states have call successors, (73) [2022-07-19 22:10:20,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 330 transitions. [2022-07-19 22:10:20,504 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 330 transitions. Word has length 210 [2022-07-19 22:10:20,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:20,505 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 330 transitions. [2022-07-19 22:10:20,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 5.5) internal successors, (77), 12 states have internal predecessors, (77), 6 states have call successors, (33), 6 states have call predecessors, (33), 3 states have return successors, (30), 4 states have call predecessors, (30), 5 states have call successors, (30) [2022-07-19 22:10:20,505 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 330 transitions. [2022-07-19 22:10:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-19 22:10:20,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:20,507 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:20,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:10:20,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:20,508 INFO L85 PathProgramCache]: Analyzing trace with hash -130056786, now seen corresponding path program 2 times [2022-07-19 22:10:20,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:20,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925990491] [2022-07-19 22:10:20,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:20,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:20,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:20,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:20,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:20,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:20,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:10:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:10:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:10:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:20,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:10:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 22:10:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:20,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:10:21,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:21,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:10:21,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:21,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:10:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:21,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:21,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:21,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 22:10:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:21,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 22:10:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:21,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-19 22:10:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:21,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:21,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-19 22:10:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2022-07-19 22:10:21,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:21,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925990491] [2022-07-19 22:10:21,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925990491] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:10:21,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95429234] [2022-07-19 22:10:21,370 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-19 22:10:21,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:21,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:21,372 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-19 22:10:21,373 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-19 22:10:21,834 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-19 22:10:21,835 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-19 22:10:21,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 1784 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-19 22:10:21,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:21,910 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-07-19 22:10:21,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:21,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95429234] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:21,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:10:21,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-07-19 22:10:21,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544251401] [2022-07-19 22:10:21,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:21,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:10:21,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:21,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:10:21,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2022-07-19 22:10:21,913 INFO L87 Difference]: Start difference. First operand 255 states and 330 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2022-07-19 22:10:21,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:21,954 INFO L93 Difference]: Finished difference Result 263 states and 337 transitions. [2022-07-19 22:10:21,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:10:21,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 221 [2022-07-19 22:10:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:21,959 INFO L225 Difference]: With dead ends: 263 [2022-07-19 22:10:21,959 INFO L226 Difference]: Without dead ends: 261 [2022-07-19 22:10:21,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 285 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:10:21,962 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 12 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1212 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:21,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1212 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:10:21,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-19 22:10:21,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2022-07-19 22:10:21,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 164 states have (on average 1.170731707317073) internal successors, (192), 165 states have internal predecessors, (192), 68 states have call successors, (68), 25 states have call predecessors, (68), 26 states have return successors, (73), 68 states have call predecessors, (73), 67 states have call successors, (73) [2022-07-19 22:10:21,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 333 transitions. [2022-07-19 22:10:21,979 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 333 transitions. Word has length 221 [2022-07-19 22:10:21,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:21,980 INFO L495 AbstractCegarLoop]: Abstraction has 259 states and 333 transitions. [2022-07-19 22:10:21,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2022-07-19 22:10:21,980 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 333 transitions. [2022-07-19 22:10:21,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2022-07-19 22:10:21,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:21,983 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:22,006 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-19 22:10:22,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:22,196 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:22,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:22,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1053277728, now seen corresponding path program 1 times [2022-07-19 22:10:22,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:22,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931826767] [2022-07-19 22:10:22,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:22,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:22,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:22,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:22,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:10:22,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:10:22,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:10:22,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:22,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:10:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 22:10:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:10:22,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:10:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:10:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 22:10:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 22:10:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-19 22:10:22,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-19 22:10:22,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-07-19 22:10:22,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-19 22:10:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:22,993 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2022-07-19 22:10:22,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:22,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931826767] [2022-07-19 22:10:22,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931826767] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:10:22,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545398793] [2022-07-19 22:10:22,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:22,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:22,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:22,995 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-19 22:10:23,015 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-19 22:10:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:23,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 2879 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-19 22:10:23,566 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 32 proven. 9 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-07-19 22:10:23,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:10:23,928 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-07-19 22:10:23,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545398793] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 22:10:23,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:10:23,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16, 8] total 24 [2022-07-19 22:10:23,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170198835] [2022-07-19 22:10:23,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:23,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:10:23,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:23,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:10:23,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=498, Unknown=0, NotChecked=0, Total=552 [2022-07-19 22:10:23,931 INFO L87 Difference]: Start difference. First operand 259 states and 333 transitions. Second operand has 5 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2022-07-19 22:10:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:23,990 INFO L93 Difference]: Finished difference Result 267 states and 340 transitions. [2022-07-19 22:10:23,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:10:23,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 234 [2022-07-19 22:10:23,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:23,992 INFO L225 Difference]: With dead ends: 267 [2022-07-19 22:10:23,992 INFO L226 Difference]: Without dead ends: 265 [2022-07-19 22:10:23,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 553 GetRequests, 530 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=542, Unknown=0, NotChecked=0, Total=600 [2022-07-19 22:10:23,994 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 6 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 1222 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:10:23,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 1222 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:10:23,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-07-19 22:10:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2022-07-19 22:10:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 167 states have (on average 1.1676646706586826) internal successors, (195), 168 states have internal predecessors, (195), 68 states have call successors, (68), 26 states have call predecessors, (68), 27 states have return successors, (73), 68 states have call predecessors, (73), 67 states have call successors, (73) [2022-07-19 22:10:24,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 336 transitions. [2022-07-19 22:10:24,009 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 336 transitions. Word has length 234 [2022-07-19 22:10:24,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:24,009 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 336 transitions. [2022-07-19 22:10:24,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2022-07-19 22:10:24,010 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 336 transitions. [2022-07-19 22:10:24,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-19 22:10:24,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:24,012 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:24,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-19 22:10:24,235 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,SelfDestructingSolverStorable9 [2022-07-19 22:10:24,235 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:24,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:24,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2025730660, now seen corresponding path program 1 times [2022-07-19 22:10:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:24,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431456872] [2022-07-19 22:10:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:24,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:24,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:24,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:10:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:10:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:10:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:24,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:10:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 22:10:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:10:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:10:24,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:10:24,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:24,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 22:10:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 22:10:24,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-19 22:10:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:10:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:25,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-19 22:10:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-19 22:10:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:25,027 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-07-19 22:10:25,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:25,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431456872] [2022-07-19 22:10:25,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431456872] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:10:25,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684319328] [2022-07-19 22:10:25,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:25,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:25,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:25,029 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-19 22:10:25,030 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-19 22:10:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:25,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 2969 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-19 22:10:25,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:25,791 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2022-07-19 22:10:25,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:10:25,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684319328] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:10:25,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:10:25,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 19 [2022-07-19 22:10:25,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851408934] [2022-07-19 22:10:25,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:10:25,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:10:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:10:25,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:10:25,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:10:25,793 INFO L87 Difference]: Start difference. First operand 263 states and 336 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-19 22:10:25,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:10:25,819 INFO L93 Difference]: Finished difference Result 345 states and 437 transitions. [2022-07-19 22:10:25,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:10:25,819 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 241 [2022-07-19 22:10:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:10:25,821 INFO L225 Difference]: With dead ends: 345 [2022-07-19 22:10:25,821 INFO L226 Difference]: Without dead ends: 272 [2022-07-19 22:10:25,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 310 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-19 22:10:25,822 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 3 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1241 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-19 22:10:25,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1241 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:10:25,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-07-19 22:10:25,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 267. [2022-07-19 22:10:25,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 170 states have (on average 1.1647058823529413) internal successors, (198), 171 states have internal predecessors, (198), 68 states have call successors, (68), 26 states have call predecessors, (68), 28 states have return successors, (74), 69 states have call predecessors, (74), 67 states have call successors, (74) [2022-07-19 22:10:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 340 transitions. [2022-07-19 22:10:25,838 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 340 transitions. Word has length 241 [2022-07-19 22:10:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:10:25,839 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 340 transitions. [2022-07-19 22:10:25,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-19 22:10:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 340 transitions. [2022-07-19 22:10:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-19 22:10:25,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:10:25,842 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:10:25,873 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-19 22:10:26,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:26,067 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:10:26,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:10:26,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1682430622, now seen corresponding path program 1 times [2022-07-19 22:10:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:10:26,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823777553] [2022-07-19 22:10:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:26,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:10:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-19 22:10:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-19 22:10:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:10:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-19 22:10:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-19 22:10:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:10:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-19 22:10:26,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-19 22:10:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-19 22:10:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-19 22:10:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-19 22:10:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-19 22:10:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-19 22:10:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:26,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-19 22:10:26,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-19 22:10:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-19 22:10:26,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-19 22:10:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-19 22:10:26,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-19 22:10:26,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-19 22:10:26,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:26,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2022-07-19 22:10:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-19 22:10:26,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-19 22:10:26,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-19 22:10:26,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:10:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-19 22:10:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-19 22:10:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-19 22:10:26,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:26,842 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 437 trivial. 0 not checked. [2022-07-19 22:10:26,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:10:26,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823777553] [2022-07-19 22:10:26,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823777553] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:10:26,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469261296] [2022-07-19 22:10:26,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:10:26,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:10:26,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:10:26,848 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-19 22:10:26,872 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-19 22:10:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:10:27,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 2968 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-19 22:10:27,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:10:27,856 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 11 treesize of output 7 [2022-07-19 22:10:30,439 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base_BEFORE_CALL_44| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base_BEFORE_CALL_44|) 0))) (and (not (= .cse0 0)) (< (+ .cse0 1) |v_ULTIMATE.start_aws_hash_table_find_harness_~#map~0#1.base_BEFORE_CALL_44|)))) is different from true [2022-07-19 22:10:30,520 INFO L356 Elim1Store]: treesize reduction 45, result has 19.6 percent of original size [2022-07-19 22:10:30,521 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-19 22:10:30,546 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-19 22:10:30,723 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,SelfDestructingSolverStorable11 [2022-07-19 22:10:30,724 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_95| input size 50 context size 50 output size 50 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:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:650) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:611) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:529) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:333) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) 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:269) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:255) 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-19 22:10:30,729 INFO L158 Benchmark]: Toolchain (without parser) took 35894.83ms. Allocated memory was 92.3MB in the beginning and 528.5MB in the end (delta: 436.2MB). Free memory was 65.1MB in the beginning and 277.0MB in the end (delta: -211.9MB). Peak memory consumption was 223.9MB. Max. memory is 16.1GB. [2022-07-19 22:10:30,729 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 92.3MB. Free memory was 72.8MB in the beginning and 72.8MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:10:30,729 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2956.84ms. Allocated memory was 92.3MB in the beginning and 140.5MB in the end (delta: 48.2MB). Free memory was 64.9MB in the beginning and 80.0MB in the end (delta: -15.2MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. [2022-07-19 22:10:30,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 185.64ms. Allocated memory is still 140.5MB. Free memory was 80.0MB in the beginning and 68.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-19 22:10:30,730 INFO L158 Benchmark]: Boogie Preprocessor took 130.85ms. Allocated memory is still 140.5MB. Free memory was 68.1MB in the beginning and 59.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 22:10:30,730 INFO L158 Benchmark]: RCFGBuilder took 1390.94ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 59.7MB in the beginning and 89.4MB in the end (delta: -29.7MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2022-07-19 22:10:30,730 INFO L158 Benchmark]: TraceAbstraction took 31225.62ms. Allocated memory was 169.9MB in the beginning and 528.5MB in the end (delta: 358.6MB). Free memory was 88.3MB in the beginning and 277.0MB in the end (delta: -188.7MB). Peak memory consumption was 171.9MB. Max. memory is 16.1GB. [2022-07-19 22:10:30,732 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.30ms. Allocated memory is still 92.3MB. Free memory was 72.8MB in the beginning and 72.8MB in the end (delta: 42.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2956.84ms. Allocated memory was 92.3MB in the beginning and 140.5MB in the end (delta: 48.2MB). Free memory was 64.9MB in the beginning and 80.0MB in the end (delta: -15.2MB). Peak memory consumption was 68.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 185.64ms. Allocated memory is still 140.5MB. Free memory was 80.0MB in the beginning and 68.1MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 130.85ms. Allocated memory is still 140.5MB. Free memory was 68.1MB in the beginning and 59.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1390.94ms. Allocated memory was 140.5MB in the beginning and 169.9MB in the end (delta: 29.4MB). Free memory was 59.7MB in the beginning and 89.4MB in the end (delta: -29.7MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31225.62ms. Allocated memory was 169.9MB in the beginning and 528.5MB in the end (delta: 358.6MB). Free memory was 88.3MB in the beginning and 277.0MB in the end (delta: -188.7MB). Peak memory consumption was 171.9MB. 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_95| input size 50 context size 50 output size 50 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_95| input size 50 context size 50 output size 50: 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-19 22:10:30,777 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_hash_table_find_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 b2aa49e297f60cfce052f243c4868c3f21a4b7a15679d0734b9f9fae5c35ea17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:10:32,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:10:32,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:10:32,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:10:32,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:10:32,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:10:32,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:10:32,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:10:32,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:10:32,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:10:32,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:10:32,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:10:32,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:10:32,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:10:32,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:10:32,774 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:10:32,775 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:10:32,776 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:10:32,779 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:10:32,785 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:10:32,786 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:10:32,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:10:32,789 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:10:32,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:10:32,791 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:10:32,797 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:10:32,797 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:10:32,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:10:32,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:10:32,798 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:10:32,799 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:10:32,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:10:32,801 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:10:32,801 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:10:32,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:10:32,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:10:32,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:10:32,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:10:32,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:10:32,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:10:32,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:10:32,806 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:10:32,814 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-19 22:10:32,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:10:32,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:10:32,844 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:10:32,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:10:32,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:10:32,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:10:32,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:10:32,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:10:32,846 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:10:32,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:10:32,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:10:32,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:10:32,854 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:10:32,855 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:10:32,855 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-19 22:10:32,855 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-19 22:10:32,855 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-19 22:10:32,856 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:10:32,856 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:10:32,856 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:10:32,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:10:32,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:10:32,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:10:32,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:10:32,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:10:32,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:10:32,857 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:10:32,858 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-19 22:10:32,858 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-19 22:10:32,858 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:10:32,858 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:10:32,859 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:10:32,859 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-19 22:10:32,859 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 -> b2aa49e297f60cfce052f243c4868c3f21a4b7a15679d0734b9f9fae5c35ea17 [2022-07-19 22:10:33,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:10:33,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:10:33,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:10:33,243 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:10:33,244 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:10:33,245 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i [2022-07-19 22:10:33,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662f6aed2/7dd3af2c79dc497b96c9918067a9ce89/FLAG6862687d4 [2022-07-19 22:10:33,928 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:10:33,928 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_find_harness.i [2022-07-19 22:10:33,965 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662f6aed2/7dd3af2c79dc497b96c9918067a9ce89/FLAG6862687d4 [2022-07-19 22:10:34,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662f6aed2/7dd3af2c79dc497b96c9918067a9ce89 [2022-07-19 22:10:34,103 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:10:34,104 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:10:34,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:10:34,107 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:10:34,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:10:34,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:10:34" (1/1) ... [2022-07-19 22:10:34,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764b67e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:10:34, skipping insertion in model container [2022-07-19 22:10:34,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:10:34" (1/1) ... [2022-07-19 22:10:34,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:10:34,232 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:10:34,508 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_hash_table_find_harness.i[4493,4506] [2022-07-19 22:10:34,515 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_hash_table_find_harness.i[4553,4566] [2022-07-19 22:10:35,344 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,345 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,345 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,346 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,347 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,358 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,359 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,361 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,362 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,366 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,367 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,368 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,368 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:10:35,665 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:10:35,666 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:10:35,667 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:10:35,667 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:10:35,668 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:10:35,669 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:10:35,669 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:10:35,670 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:10:35,670 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:10:35,671 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:10:35,801 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:10:35,814 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.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1454) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1397) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) 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-19 22:10:35,824 INFO L158 Benchmark]: Toolchain (without parser) took 1718.36ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 32.8MB in the beginning and 48.4MB in the end (delta: -15.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-07-19 22:10:35,825 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 44.4MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:10:35,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1715.50ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 32.6MB in the beginning and 48.4MB in the end (delta: -15.8MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-07-19 22:10:35,830 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.21ms. Allocated memory is still 62.9MB. Free memory was 44.4MB in the beginning and 44.4MB in the end (delta: 44.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1715.50ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 32.6MB in the beginning and 48.4MB in the end (delta: -15.8MB). Peak memory consumption was 21.1MB. 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