./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_put_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 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:08:58,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:08:58,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:08:58,333 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:08:58,333 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:08:58,334 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:08:58,335 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:08:58,336 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:08:58,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:08:58,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:08:58,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:08:58,339 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:08:58,339 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:08:58,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:08:58,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:08:58,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:08:58,342 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:08:58,343 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:08:58,344 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:08:58,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:08:58,346 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:08:58,347 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:08:58,348 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:08:58,349 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:08:58,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:08:58,351 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:08:58,351 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:08:58,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:08:58,352 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:08:58,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:08:58,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:08:58,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:08:58,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:08:58,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:08:58,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:08:58,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:08:58,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:08:58,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:08:58,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:08:58,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:08:58,357 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:08:58,358 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:08:58,358 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 11:08:58,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:08:58,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:08:58,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:08:58,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:08:58,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:08:58,373 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:08:58,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:08:58,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:08:58,374 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:08:58,374 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:08:58,375 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:08:58,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:08:58,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:08:58,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:08:58,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:08:58,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:08:58,376 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:08:58,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:08:58,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:08:58,376 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:08:58,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:08:58,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:08:58,377 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:08:58,377 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:08:58,377 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:08:58,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:08:58,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:08:58,378 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:08:58,378 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:08:58,378 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:08:58,378 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 -> 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 [2022-07-12 11:08:58,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:08:58,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:08:58,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:08:58,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:08:58,598 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:08:58,599 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_put_harness.i [2022-07-12 11:08:58,666 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d064d6ce/a9f2571b1788468babc7508c401505cb/FLAG6ea687633 [2022-07-12 11:08:59,266 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:08:59,266 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2022-07-12 11:08:59,293 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d064d6ce/a9f2571b1788468babc7508c401505cb/FLAG6ea687633 [2022-07-12 11:08:59,426 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d064d6ce/a9f2571b1788468babc7508c401505cb [2022-07-12 11:08:59,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:08:59,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:08:59,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:08:59,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:08:59,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:08:59,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:08:59" (1/1) ... [2022-07-12 11:08:59,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7117aa3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:08:59, skipping insertion in model container [2022-07-12 11:08:59,453 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:08:59" (1/1) ... [2022-07-12 11:08:59,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:08:59,531 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:08:59,774 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_put_harness.i[4492,4505] [2022-07-12 11:08:59,779 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_put_harness.i[4552,4565] [2022-07-12 11:09:00,314 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,315 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,315 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,316 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,316 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,324 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,324 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,325 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,325 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,327 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,327 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,328 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,328 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,556 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:09:00,557 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:09:00,558 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:09:00,558 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:09:00,559 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:09:00,560 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:09:00,560 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:09:00,560 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:09:00,561 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:09:00,562 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:09:00,679 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:09:00,879 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,879 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,892 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,893 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,896 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,896 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,904 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,905 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,906 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,906 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,906 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,906 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,907 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:00,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:09:00,967 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:09:00,983 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_put_harness.i[4492,4505] [2022-07-12 11:09:00,984 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_put_harness.i[4552,4565] [2022-07-12 11:09:01,012 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,013 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,013 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,013 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,013 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,019 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,020 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,020 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,020 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,021 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,021 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,021 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,021 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,039 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:09:01,039 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:09:01,040 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:09:01,040 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:09:01,041 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:09:01,041 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:09:01,041 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:09:01,041 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:09:01,042 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:09:01,042 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:09:01,059 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:09:01,145 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,146 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,150 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,150 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,152 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,152 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,160 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,160 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,161 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,161 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,161 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,162 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,162 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:01,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:09:01,338 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:09:01,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01 WrapperNode [2022-07-12 11:09:01,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:09:01,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:09:01,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:09:01,340 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:09:01,345 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (1/1) ... [2022-07-12 11:09:01,420 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (1/1) ... [2022-07-12 11:09:01,488 INFO L137 Inliner]: procedures = 775, calls = 2489, calls flagged for inlining = 70, calls inlined = 25, statements flattened = 1393 [2022-07-12 11:09:01,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:09:01,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:09:01,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:09:01,491 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:09:01,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (1/1) ... [2022-07-12 11:09:01,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (1/1) ... [2022-07-12 11:09:01,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (1/1) ... [2022-07-12 11:09:01,513 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (1/1) ... [2022-07-12 11:09:01,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (1/1) ... [2022-07-12 11:09:01,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (1/1) ... [2022-07-12 11:09:01,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (1/1) ... [2022-07-12 11:09:01,585 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:09:01,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:09:01,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:09:01,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:09:01,599 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (1/1) ... [2022-07-12 11:09:01,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:09:01,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:01,620 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-12 11:09:01,623 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-12 11:09:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 11:09:01,652 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_bool [2022-07-12 11:09:01,652 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_bool [2022-07-12 11:09:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 11:09:01,653 INFO L130 BoogieDeclarations]: Found specification of procedure aws_raise_error [2022-07-12 11:09:01,653 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_raise_error [2022-07-12 11:09:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:09:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:09:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_is_valid [2022-07-12 11:09:01,654 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_is_valid [2022-07-12 11:09:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 11:09:01,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:09:01,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:09:01,655 INFO L130 BoogieDeclarations]: Found specification of procedure s_emplace_item [2022-07-12 11:09:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure s_emplace_item [2022-07-12 11:09:01,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:09:01,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:09:01,655 INFO L130 BoogieDeclarations]: Found specification of procedure bounded_malloc [2022-07-12 11:09:01,656 INFO L138 BoogieDeclarations]: Found implementation of procedure bounded_malloc [2022-07-12 11:09:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mul_size_checked [2022-07-12 11:09:01,656 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mul_size_checked [2022-07-12 11:09:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure aws_mem_release [2022-07-12 11:09:01,656 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_mem_release [2022-07-12 11:09:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:09:01,656 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_plus [2022-07-12 11:09:01,657 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_plus [2022-07-12 11:09:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:09:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2022-07-12 11:09:01,657 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2022-07-12 11:09:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 11:09:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_for [2022-07-12 11:09:01,657 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_for [2022-07-12 11:09:01,657 INFO L130 BoogieDeclarations]: Found specification of procedure aws_is_power_of_two [2022-07-12 11:09:01,658 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_is_power_of_two [2022-07-12 11:09:01,658 INFO L130 BoogieDeclarations]: Found specification of procedure s_update_template_size [2022-07-12 11:09:01,658 INFO L138 BoogieDeclarations]: Found implementation of procedure s_update_template_size [2022-07-12 11:09:01,658 INFO L130 BoogieDeclarations]: Found specification of procedure s_hash_keys_eq [2022-07-12 11:09:01,658 INFO L138 BoogieDeclarations]: Found implementation of procedure s_hash_keys_eq [2022-07-12 11:09:01,658 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_equals [2022-07-12 11:09:01,658 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_equals [2022-07-12 11:09:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:09:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure aws_allocator_is_valid [2022-07-12 11:09:01,660 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_allocator_is_valid [2022-07-12 11:09:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-12 11:09:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_calloc [2022-07-12 11:09:01,662 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_calloc [2022-07-12 11:09:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 11:09:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure hash_table_state_required_bytes [2022-07-12 11:09:01,663 INFO L138 BoogieDeclarations]: Found implementation of procedure hash_table_state_required_bytes [2022-07-12 11:09:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 11:09:01,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 11:09:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_uninterpreted_hasher [2022-07-12 11:09:01,666 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_uninterpreted_hasher [2022-07-12 11:09:01,666 INFO L130 BoogieDeclarations]: Found specification of procedure s_safe_eq_check [2022-07-12 11:09:01,667 INFO L138 BoogieDeclarations]: Found implementation of procedure s_safe_eq_check [2022-07-12 11:09:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure s_find_entry [2022-07-12 11:09:01,667 INFO L138 BoogieDeclarations]: Found implementation of procedure s_find_entry [2022-07-12 11:09:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:09:01,667 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:09:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure aws_hash_table_is_valid [2022-07-12 11:09:01,667 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_hash_table_is_valid [2022-07-12 11:09:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:09:01,667 INFO L130 BoogieDeclarations]: Found specification of procedure can_fail_allocator [2022-07-12 11:09:01,668 INFO L138 BoogieDeclarations]: Found implementation of procedure can_fail_allocator [2022-07-12 11:09:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure __CPROVER_overflow_mult [2022-07-12 11:09:01,668 INFO L138 BoogieDeclarations]: Found implementation of procedure __CPROVER_overflow_mult [2022-07-12 11:09:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure aws_add_size_checked [2022-07-12 11:09:01,668 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_add_size_checked [2022-07-12 11:09:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure s_alloc_state [2022-07-12 11:09:01,668 INFO L138 BoogieDeclarations]: Found implementation of procedure s_alloc_state [2022-07-12 11:09:01,668 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 11:09:01,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 11:09:01,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:09:02,008 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:09:02,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:09:02,239 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##5: assume !true; [2022-07-12 11:09:02,269 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !true; [2022-07-12 11:09:02,671 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume !true; [2022-07-12 11:09:02,672 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume !true; [2022-07-12 11:09:03,233 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:09:03,245 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:09:03,245 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-07-12 11:09:03,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:09:03 BoogieIcfgContainer [2022-07-12 11:09:03,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:09:03,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:09:03,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:09:03,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:09:03,254 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:08:59" (1/3) ... [2022-07-12 11:09:03,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3465d8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:09:03, skipping insertion in model container [2022-07-12 11:09:03,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:01" (2/3) ... [2022-07-12 11:09:03,255 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3465d8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:09:03, skipping insertion in model container [2022-07-12 11:09:03,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:09:03" (3/3) ... [2022-07-12 11:09:03,256 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_hash_table_put_harness.i [2022-07-12 11:09:03,268 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:09:03,269 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:09:03,330 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:09:03,339 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@1dcb51a8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c4c6670 [2022-07-12 11:09:03,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:09:03,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 361 states, 248 states have (on average 1.282258064516129) internal successors, (318), 245 states have internal predecessors, (318), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) [2022-07-12 11:09:03,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 11:09:03,358 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:03,359 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1] [2022-07-12 11:09:03,359 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash 200610363, now seen corresponding path program 1 times [2022-07-12 11:09:03,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165001480] [2022-07-12 11:09:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:03,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:03,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:03,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:03,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:03,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:03,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:03,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:03,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165001480] [2022-07-12 11:09:03,930 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2022-07-12 11:09:03,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057769959] [2022-07-12 11:09:03,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:03,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:03,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:03,951 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-12 11:09:03,956 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-12 11:09:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:04,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 2859 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 11:09:04,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:09:04,608 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-12 11:09:04,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:09:04,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057769959] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:04,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:04,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:09:04,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978584937] [2022-07-12 11:09:04,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:04,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 11:09:04,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:04,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 11:09:04,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 11:09:04,649 INFO L87 Difference]: Start difference. First operand has 361 states, 248 states have (on average 1.282258064516129) internal successors, (318), 245 states have internal predecessors, (318), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (86), 86 states have call predecessors, (86), 86 states have call successors, (86) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:09:04,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:04,691 INFO L93 Difference]: Finished difference Result 716 states and 1017 transitions. [2022-07-12 11:09:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 11:09:04,693 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2022-07-12 11:09:04,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:04,702 INFO L225 Difference]: With dead ends: 716 [2022-07-12 11:09:04,702 INFO L226 Difference]: Without dead ends: 355 [2022-07-12 11:09:04,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 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-12 11:09:04,711 INFO L413 NwaCegarLoop]: 479 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, 479 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-12 11:09:04,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:09:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-12 11:09:04,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2022-07-12 11:09:04,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 239 states have (on average 1.2677824267782427) internal successors, (303), 240 states have internal predecessors, (303), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 11:09:04,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 474 transitions. [2022-07-12 11:09:04,783 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 474 transitions. Word has length 136 [2022-07-12 11:09:04,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:04,784 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 474 transitions. [2022-07-12 11:09:04,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:09:04,784 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 474 transitions. [2022-07-12 11:09:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 11:09:04,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:04,787 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1] [2022-07-12 11:09:04,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 11:09:05,010 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-12 11:09:05,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:05,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:05,012 INFO L85 PathProgramCache]: Analyzing trace with hash 810580097, now seen corresponding path program 1 times [2022-07-12 11:09:05,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:05,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106656172] [2022-07-12 11:09:05,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:05,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:05,109 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:09:05,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1368230118] [2022-07-12 11:09:05,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:05,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:05,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:05,127 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-12 11:09:05,128 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-12 11:09:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:05,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 2859 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 11:09:05,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:09:05,851 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-07-12 11:09:05,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:09:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:05,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106656172] [2022-07-12 11:09:05,851 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:09:05,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368230118] [2022-07-12 11:09:05,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368230118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:05,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:05,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:09:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67241789] [2022-07-12 11:09:05,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:05,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:09:05,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:05,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:09:05,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:09:05,854 INFO L87 Difference]: Start difference. First operand 355 states and 474 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:09:06,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:06,300 INFO L93 Difference]: Finished difference Result 727 states and 982 transitions. [2022-07-12 11:09:06,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:09:06,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2022-07-12 11:09:06,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:06,305 INFO L225 Difference]: With dead ends: 727 [2022-07-12 11:09:06,305 INFO L226 Difference]: Without dead ends: 419 [2022-07-12 11:09:06,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:09:06,307 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 632 mSDsluCounter, 1275 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 1757 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:06,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 1757 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 11:09:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-12 11:09:06,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 357. [2022-07-12 11:09:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 241 states have (on average 1.2655601659751037) internal successors, (305), 242 states have internal predecessors, (305), 86 states have call successors, (86), 29 states have call predecessors, (86), 29 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-12 11:09:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 476 transitions. [2022-07-12 11:09:06,329 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 476 transitions. Word has length 136 [2022-07-12 11:09:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:06,330 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 476 transitions. [2022-07-12 11:09:06,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:09:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 476 transitions. [2022-07-12 11:09:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-12 11:09:06,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:06,332 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1] [2022-07-12 11:09:06,357 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-12 11:09:06,543 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-12 11:09:06,544 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:06,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:06,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1233281923, now seen corresponding path program 1 times [2022-07-12 11:09:06,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:06,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756088595] [2022-07-12 11:09:06,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:06,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:06,665 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:09:06,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322185288] [2022-07-12 11:09:06,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:06,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:06,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:06,667 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-12 11:09:06,668 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-12 11:09:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 2852 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 11:09:07,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:09:07,220 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 11:09:07,221 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:09:07,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:07,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756088595] [2022-07-12 11:09:07,221 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:09:07,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322185288] [2022-07-12 11:09:07,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322185288] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:07,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:07,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:09:07,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410733498] [2022-07-12 11:09:07,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:07,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:09:07,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:07,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:09:07,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:09:07,222 INFO L87 Difference]: Start difference. First operand 357 states and 476 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:09:07,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:07,295 INFO L93 Difference]: Finished difference Result 710 states and 950 transitions. [2022-07-12 11:09:07,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:09:07,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 136 [2022-07-12 11:09:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:07,299 INFO L225 Difference]: With dead ends: 710 [2022-07-12 11:09:07,299 INFO L226 Difference]: Without dead ends: 362 [2022-07-12 11:09:07,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 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-12 11:09:07,301 INFO L413 NwaCegarLoop]: 471 mSDtfsCounter, 2 mSDsluCounter, 1405 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:07,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1876 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:09:07,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-12 11:09:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2022-07-12 11:09:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 245 states have (on average 1.2612244897959184) internal successors, (309), 246 states have internal predecessors, (309), 86 states have call successors, (86), 29 states have call predecessors, (86), 30 states have return successors, (89), 86 states have call predecessors, (89), 85 states have call successors, (89) [2022-07-12 11:09:07,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 484 transitions. [2022-07-12 11:09:07,318 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 484 transitions. Word has length 136 [2022-07-12 11:09:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:07,319 INFO L495 AbstractCegarLoop]: Abstraction has 362 states and 484 transitions. [2022-07-12 11:09:07,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 11:09:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 484 transitions. [2022-07-12 11:09:07,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 11:09:07,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:07,321 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:07,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 11:09:07,540 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-12 11:09:07,541 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:07,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:07,541 INFO L85 PathProgramCache]: Analyzing trace with hash 292227623, now seen corresponding path program 1 times [2022-07-12 11:09:07,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:07,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104710091] [2022-07-12 11:09:07,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:07,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:07,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:09:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:07,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:09:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:08,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:09:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:09:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:08,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:08,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:08,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:08,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:08,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:09:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:09:08,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:08,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:09:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:08,079 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-12 11:09:08,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:08,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104710091] [2022-07-12 11:09:08,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104710091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:08,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:08,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-12 11:09:08,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197916239] [2022-07-12 11:09:08,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:08,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-12 11:09:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:08,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-12 11:09:08,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:09:08,087 INFO L87 Difference]: Start difference. First operand 362 states and 484 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 11:09:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:11,614 INFO L93 Difference]: Finished difference Result 761 states and 1022 transitions. [2022-07-12 11:09:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:09:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 142 [2022-07-12 11:09:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:11,618 INFO L225 Difference]: With dead ends: 761 [2022-07-12 11:09:11,618 INFO L226 Difference]: Without dead ends: 420 [2022-07-12 11:09:11,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2022-07-12 11:09:11,620 INFO L413 NwaCegarLoop]: 420 mSDtfsCounter, 319 mSDsluCounter, 1696 mSDsCounter, 0 mSdLazyCounter, 2596 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 2116 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:11,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 2116 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2596 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 11:09:11,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-07-12 11:09:11,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 367. [2022-07-12 11:09:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 249 states have (on average 1.2610441767068272) internal successors, (314), 251 states have internal predecessors, (314), 86 states have call successors, (86), 29 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-07-12 11:09:11,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 490 transitions. [2022-07-12 11:09:11,638 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 490 transitions. Word has length 142 [2022-07-12 11:09:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:11,639 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 490 transitions. [2022-07-12 11:09:11,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 9 states have internal predecessors, (68), 4 states have call successors, (24), 5 states have call predecessors, (24), 3 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2022-07-12 11:09:11,639 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 490 transitions. [2022-07-12 11:09:11,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 11:09:11,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:11,641 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:11,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:09:11,641 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:11,642 INFO L85 PathProgramCache]: Analyzing trace with hash 319293225, now seen corresponding path program 1 times [2022-07-12 11:09:11,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:11,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834443724] [2022-07-12 11:09:11,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:11,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:11,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:11,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:11,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:11,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:11,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 11:09:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:09:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:09:11,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:09:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:11,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:12,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 11:09:12,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:12,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 11:09:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-12 11:09:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-07-12 11:09:12,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:12,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834443724] [2022-07-12 11:09:12,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834443724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:12,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:12,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:09:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266760852] [2022-07-12 11:09:12,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:12,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:09:12,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:09:12,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:09:12,078 INFO L87 Difference]: Start difference. First operand 367 states and 490 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 11:09:13,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:13,562 INFO L93 Difference]: Finished difference Result 768 states and 1030 transitions. [2022-07-12 11:09:13,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:09:13,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) Word has length 142 [2022-07-12 11:09:13,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:13,566 INFO L225 Difference]: With dead ends: 768 [2022-07-12 11:09:13,566 INFO L226 Difference]: Without dead ends: 415 [2022-07-12 11:09:13,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:09:13,569 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 523 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 1275 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:13,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 1275 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1139 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-12 11:09:13,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-07-12 11:09:13,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 365. [2022-07-12 11:09:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 247 states have (on average 1.2550607287449393) internal successors, (310), 249 states have internal predecessors, (310), 86 states have call successors, (86), 29 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-07-12 11:09:13,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 486 transitions. [2022-07-12 11:09:13,591 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 486 transitions. Word has length 142 [2022-07-12 11:09:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:13,592 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 486 transitions. [2022-07-12 11:09:13,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (22), 3 states have call predecessors, (22), 3 states have call successors, (22) [2022-07-12 11:09:13,592 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 486 transitions. [2022-07-12 11:09:13,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-12 11:09:13,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:13,594 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:13,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:09:13,595 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:13,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1626460037, now seen corresponding path program 1 times [2022-07-12 11:09:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:13,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157326582] [2022-07-12 11:09:13,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:13,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:13,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:13,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:13,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:13,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:13,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-12 11:09:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-12 11:09:13,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-07-12 11:09:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 11:09:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-12 11:09:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 11:09:13,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 11:09:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 11:09:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:13,946 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2022-07-12 11:09:13,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157326582] [2022-07-12 11:09:13,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157326582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:09:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504476594] [2022-07-12 11:09:13,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:13,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:13,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:13,948 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-12 11:09:14,007 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-12 11:09:14,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:14,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 2880 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-12 11:09:14,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:09:15,587 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-12 11:09:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-12 11:09:21,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:09:21,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504476594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:21,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:09:21,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2022-07-12 11:09:21,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938602048] [2022-07-12 11:09:21,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:21,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:09:21,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:21,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:09:21,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2022-07-12 11:09:21,798 INFO L87 Difference]: Start difference. First operand 365 states and 486 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 11:09:22,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:22,259 INFO L93 Difference]: Finished difference Result 713 states and 950 transitions. [2022-07-12 11:09:22,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:09:22,265 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) Word has length 148 [2022-07-12 11:09:22,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:22,266 INFO L225 Difference]: With dead ends: 713 [2022-07-12 11:09:22,266 INFO L226 Difference]: Without dead ends: 367 [2022-07-12 11:09:22,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=51, Invalid=222, Unknown=3, NotChecked=30, Total=306 [2022-07-12 11:09:22,268 INFO L413 NwaCegarLoop]: 467 mSDtfsCounter, 5 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2504 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 676 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:22,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2504 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 676 Unchecked, 0.4s Time] [2022-07-12 11:09:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-07-12 11:09:22,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-07-12 11:09:22,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 249 states have (on average 1.2530120481927711) internal successors, (312), 250 states have internal predecessors, (312), 86 states have call successors, (86), 30 states have call predecessors, (86), 31 states have return successors, (90), 86 states have call predecessors, (90), 85 states have call successors, (90) [2022-07-12 11:09:22,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 488 transitions. [2022-07-12 11:09:22,293 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 488 transitions. Word has length 148 [2022-07-12 11:09:22,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:22,294 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 488 transitions. [2022-07-12 11:09:22,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (23), 2 states have call predecessors, (23), 3 states have call successors, (23) [2022-07-12 11:09:22,294 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 488 transitions. [2022-07-12 11:09:22,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 11:09:22,295 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:22,295 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:22,318 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-12 11:09:22,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:22,516 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:22,516 INFO L85 PathProgramCache]: Analyzing trace with hash -510156165, now seen corresponding path program 1 times [2022-07-12 11:09:22,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:22,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331942285] [2022-07-12 11:09:22,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:22,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:22,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:22,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:22,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:22,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:22,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 11:09:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-12 11:09:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:22,977 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-12 11:09:22,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:22,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331942285] [2022-07-12 11:09:22,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331942285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:22,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:22,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:09:22,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801358005] [2022-07-12 11:09:22,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:22,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:09:22,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:22,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:09:22,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:09:22,980 INFO L87 Difference]: Start difference. First operand 367 states and 488 transitions. Second operand has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 11:09:24,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:24,306 INFO L93 Difference]: Finished difference Result 733 states and 982 transitions. [2022-07-12 11:09:24,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:09:24,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2022-07-12 11:09:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:24,311 INFO L225 Difference]: With dead ends: 733 [2022-07-12 11:09:24,312 INFO L226 Difference]: Without dead ends: 419 [2022-07-12 11:09:24,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 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-12 11:09:24,313 INFO L413 NwaCegarLoop]: 424 mSDtfsCounter, 433 mSDsluCounter, 1198 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 1767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:24,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1622 Invalid, 1767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 1410 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-12 11:09:24,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-07-12 11:09:24,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 369. [2022-07-12 11:09:24,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 250 states have (on average 1.252) internal successors, (313), 252 states have internal predecessors, (313), 86 states have call successors, (86), 30 states have call predecessors, (86), 32 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-12 11:09:24,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 494 transitions. [2022-07-12 11:09:24,329 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 494 transitions. Word has length 153 [2022-07-12 11:09:24,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:24,329 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 494 transitions. [2022-07-12 11:09:24,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.375) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (26), 5 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 11:09:24,330 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 494 transitions. [2022-07-12 11:09:24,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-12 11:09:24,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:24,331 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:24,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:09:24,331 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:24,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:24,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1781778211, now seen corresponding path program 1 times [2022-07-12 11:09:24,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:24,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228334031] [2022-07-12 11:09:24,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:24,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:25,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:25,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:25,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:25,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:25,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:25,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:25,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:25,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:25,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 11:09:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:25,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 11:09:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:25,420 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-12 11:09:25,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:25,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228334031] [2022-07-12 11:09:25,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228334031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:25,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:25,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:09:25,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948533450] [2022-07-12 11:09:25,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:25,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:09:25,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:25,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:09:25,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:09:25,423 INFO L87 Difference]: Start difference. First operand 369 states and 494 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-12 11:09:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:27,118 INFO L93 Difference]: Finished difference Result 427 states and 573 transitions. [2022-07-12 11:09:27,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:09:27,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 158 [2022-07-12 11:09:27,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:27,120 INFO L225 Difference]: With dead ends: 427 [2022-07-12 11:09:27,120 INFO L226 Difference]: Without dead ends: 425 [2022-07-12 11:09:27,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:09:27,121 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 217 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 1280 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1505 SdHoareTripleChecker+Invalid, 1401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:27,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1505 Invalid, 1401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1280 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-12 11:09:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2022-07-12 11:09:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 373. [2022-07-12 11:09:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 253 states have (on average 1.2490118577075098) internal successors, (316), 255 states have internal predecessors, (316), 86 states have call successors, (86), 31 states have call predecessors, (86), 33 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-12 11:09:27,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 497 transitions. [2022-07-12 11:09:27,136 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 497 transitions. Word has length 158 [2022-07-12 11:09:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:27,137 INFO L495 AbstractCegarLoop]: Abstraction has 373 states and 497 transitions. [2022-07-12 11:09:27,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2022-07-12 11:09:27,137 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 497 transitions. [2022-07-12 11:09:27,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 11:09:27,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:27,138 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:27,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:09:27,139 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:27,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:27,139 INFO L85 PathProgramCache]: Analyzing trace with hash 655304915, now seen corresponding path program 1 times [2022-07-12 11:09:27,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:27,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369837488] [2022-07-12 11:09:27,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:27,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:27,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:27,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:27,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:27,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:27,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:27,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:27,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 11:09:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 11:09:27,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 11:09:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 11:09:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:27,649 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-12 11:09:27,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:27,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369837488] [2022-07-12 11:09:27,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369837488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:27,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:27,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:09:27,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661593698] [2022-07-12 11:09:27,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:27,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:09:27,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:27,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:09:27,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:09:27,651 INFO L87 Difference]: Start difference. First operand 373 states and 497 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:09:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:29,579 INFO L93 Difference]: Finished difference Result 433 states and 579 transitions. [2022-07-12 11:09:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:09:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2022-07-12 11:09:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:29,582 INFO L225 Difference]: With dead ends: 433 [2022-07-12 11:09:29,582 INFO L226 Difference]: Without dead ends: 431 [2022-07-12 11:09:29,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:09:29,583 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 325 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1190 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 1427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:29,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 1446 Invalid, 1427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1190 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-12 11:09:29,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2022-07-12 11:09:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 378. [2022-07-12 11:09:29,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 256 states have (on average 1.24609375) internal successors, (319), 259 states have internal predecessors, (319), 87 states have call successors, (87), 32 states have call predecessors, (87), 34 states have return successors, (96), 86 states have call predecessors, (96), 86 states have call successors, (96) [2022-07-12 11:09:29,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 502 transitions. [2022-07-12 11:09:29,613 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 502 transitions. Word has length 171 [2022-07-12 11:09:29,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:29,615 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 502 transitions. [2022-07-12 11:09:29,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:09:29,615 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 502 transitions. [2022-07-12 11:09:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 11:09:29,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:29,617 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:09:29,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 11:09:29,617 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:29,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:29,618 INFO L85 PathProgramCache]: Analyzing trace with hash 657151957, now seen corresponding path program 1 times [2022-07-12 11:09:29,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:29,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916745159] [2022-07-12 11:09:29,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:29,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:30,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:30,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:30,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:30,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:30,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:30,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:30,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:30,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-12 11:09:30,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:30,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-12 11:09:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-12 11:09:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-12 11:09:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-12 11:09:30,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:30,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916745159] [2022-07-12 11:09:30,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916745159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:30,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:30,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:09:30,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346184059] [2022-07-12 11:09:30,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:30,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:09:30,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:30,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:09:30,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:09:30,316 INFO L87 Difference]: Start difference. First operand 378 states and 502 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:09:31,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:31,763 INFO L93 Difference]: Finished difference Result 436 states and 581 transitions. [2022-07-12 11:09:31,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:09:31,764 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 171 [2022-07-12 11:09:31,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:31,766 INFO L225 Difference]: With dead ends: 436 [2022-07-12 11:09:31,766 INFO L226 Difference]: Without dead ends: 434 [2022-07-12 11:09:31,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:09:31,767 INFO L413 NwaCegarLoop]: 437 mSDtfsCounter, 438 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:31,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 1419 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 11:09:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-07-12 11:09:31,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 377. [2022-07-12 11:09:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 256 states have (on average 1.24609375) internal successors, (319), 258 states have internal predecessors, (319), 86 states have call successors, (86), 32 states have call predecessors, (86), 34 states have return successors, (95), 86 states have call predecessors, (95), 85 states have call successors, (95) [2022-07-12 11:09:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 500 transitions. [2022-07-12 11:09:31,795 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 500 transitions. Word has length 171 [2022-07-12 11:09:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:31,795 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 500 transitions. [2022-07-12 11:09:31,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:09:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 500 transitions. [2022-07-12 11:09:31,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-12 11:09:31,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:31,797 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 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-12 11:09:31,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 11:09:31,798 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:31,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:31,798 INFO L85 PathProgramCache]: Analyzing trace with hash 220397050, now seen corresponding path program 1 times [2022-07-12 11:09:31,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:31,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949271635] [2022-07-12 11:09:31,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:31,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:31,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:31,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:31,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:31,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:31,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:31,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:32,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:32,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:32,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:32,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:32,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:32,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:09:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:09:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:09:32,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:32,174 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-12 11:09:32,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:32,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949271635] [2022-07-12 11:09:32,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949271635] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:32,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:32,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:09:32,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884516534] [2022-07-12 11:09:32,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:32,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:09:32,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:32,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:09:32,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:09:32,176 INFO L87 Difference]: Start difference. First operand 377 states and 500 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 11:09:36,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:36,204 INFO L93 Difference]: Finished difference Result 815 states and 1116 transitions. [2022-07-12 11:09:36,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 11:09:36,205 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 177 [2022-07-12 11:09:36,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:36,208 INFO L225 Difference]: With dead ends: 815 [2022-07-12 11:09:36,208 INFO L226 Difference]: Without dead ends: 515 [2022-07-12 11:09:36,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:09:36,209 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 999 mSDsluCounter, 1572 mSDsCounter, 0 mSdLazyCounter, 2040 mSolverCounterSat, 708 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 2054 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 708 IncrementalHoareTripleChecker+Valid, 2040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:36,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 2054 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [708 Valid, 2040 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 11:09:36,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-07-12 11:09:36,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 381. [2022-07-12 11:09:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 259 states have (on average 1.2432432432432432) internal successors, (322), 261 states have internal predecessors, (322), 87 states have call successors, (87), 32 states have call predecessors, (87), 34 states have return successors, (96), 87 states have call predecessors, (96), 86 states have call successors, (96) [2022-07-12 11:09:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 505 transitions. [2022-07-12 11:09:36,227 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 505 transitions. Word has length 177 [2022-07-12 11:09:36,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:36,227 INFO L495 AbstractCegarLoop]: Abstraction has 381 states and 505 transitions. [2022-07-12 11:09:36,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 7 states have internal predecessors, (86), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 11:09:36,228 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 505 transitions. [2022-07-12 11:09:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-12 11:09:36,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:36,229 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 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-12 11:09:36,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 11:09:36,229 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:36,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:36,230 INFO L85 PathProgramCache]: Analyzing trace with hash -597251400, now seen corresponding path program 1 times [2022-07-12 11:09:36,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:36,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101622112] [2022-07-12 11:09:36,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:36,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:36,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:36,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:36,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:36,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:36,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:36,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:09:36,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:09:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:09:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-12 11:09:36,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:36,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101622112] [2022-07-12 11:09:36,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101622112] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:36,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:36,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:09:36,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405487023] [2022-07-12 11:09:36,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:36,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:09:36,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:36,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:09:36,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:09:36,676 INFO L87 Difference]: Start difference. First operand 381 states and 505 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:09:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:39,824 INFO L93 Difference]: Finished difference Result 570 states and 782 transitions. [2022-07-12 11:09:39,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:09:39,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 177 [2022-07-12 11:09:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:39,833 INFO L225 Difference]: With dead ends: 570 [2022-07-12 11:09:39,834 INFO L226 Difference]: Without dead ends: 513 [2022-07-12 11:09:39,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:09:39,835 INFO L413 NwaCegarLoop]: 527 mSDtfsCounter, 415 mSDsluCounter, 1441 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 1748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:39,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 1968 Invalid, 1748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 11:09:39,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2022-07-12 11:09:39,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 385. [2022-07-12 11:09:39,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 262 states have (on average 1.2404580152671756) internal successors, (325), 264 states have internal predecessors, (325), 87 states have call successors, (87), 32 states have call predecessors, (87), 35 states have return successors, (97), 88 states have call predecessors, (97), 86 states have call successors, (97) [2022-07-12 11:09:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 509 transitions. [2022-07-12 11:09:39,852 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 509 transitions. Word has length 177 [2022-07-12 11:09:39,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:39,852 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 509 transitions. [2022-07-12 11:09:39,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:09:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 509 transitions. [2022-07-12 11:09:39,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2022-07-12 11:09:39,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:39,854 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 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-12 11:09:39,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 11:09:39,854 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:39,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1081589820, now seen corresponding path program 1 times [2022-07-12 11:09:39,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:39,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578875984] [2022-07-12 11:09:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:39,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:40,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:40,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:40,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:40,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:40,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:40,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:40,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:09:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:40,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:09:40,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:09:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-12 11:09:40,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:40,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578875984] [2022-07-12 11:09:40,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578875984] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:40,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:40,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:09:40,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640975743] [2022-07-12 11:09:40,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:40,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:09:40,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:40,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:09:40,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:09:40,195 INFO L87 Difference]: Start difference. First operand 385 states and 509 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:09:43,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:43,381 INFO L93 Difference]: Finished difference Result 691 states and 922 transitions. [2022-07-12 11:09:43,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:09:43,381 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 179 [2022-07-12 11:09:43,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:43,383 INFO L225 Difference]: With dead ends: 691 [2022-07-12 11:09:43,383 INFO L226 Difference]: Without dead ends: 462 [2022-07-12 11:09:43,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:09:43,384 INFO L413 NwaCegarLoop]: 455 mSDtfsCounter, 472 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 392 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 392 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:43,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1128 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [392 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 11:09:43,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-07-12 11:09:43,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 386. [2022-07-12 11:09:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 263 states have (on average 1.2395437262357414) internal successors, (326), 265 states have internal predecessors, (326), 87 states have call successors, (87), 32 states have call predecessors, (87), 35 states have return successors, (97), 88 states have call predecessors, (97), 86 states have call successors, (97) [2022-07-12 11:09:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 510 transitions. [2022-07-12 11:09:43,401 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 510 transitions. Word has length 179 [2022-07-12 11:09:43,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:43,402 INFO L495 AbstractCegarLoop]: Abstraction has 386 states and 510 transitions. [2022-07-12 11:09:43,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:09:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 510 transitions. [2022-07-12 11:09:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-12 11:09:43,403 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:43,403 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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-12 11:09:43,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 11:09:43,404 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:43,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:43,404 INFO L85 PathProgramCache]: Analyzing trace with hash -517004810, now seen corresponding path program 1 times [2022-07-12 11:09:43,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:43,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740754271] [2022-07-12 11:09:43,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:43,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:43,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:43,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:43,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:43,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:43,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:43,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:43,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:09:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:09:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 11:09:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 11:09:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-12 11:09:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:43,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740754271] [2022-07-12 11:09:43,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740754271] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:43,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:43,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:09:43,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450398237] [2022-07-12 11:09:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:43,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:09:43,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:43,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:09:43,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:09:43,922 INFO L87 Difference]: Start difference. First operand 386 states and 510 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-12 11:09:46,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:46,473 INFO L93 Difference]: Finished difference Result 839 states and 1140 transitions. [2022-07-12 11:09:46,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 11:09:46,474 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) Word has length 186 [2022-07-12 11:09:46,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:46,476 INFO L225 Difference]: With dead ends: 839 [2022-07-12 11:09:46,476 INFO L226 Difference]: Without dead ends: 546 [2022-07-12 11:09:46,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2022-07-12 11:09:46,478 INFO L413 NwaCegarLoop]: 482 mSDtfsCounter, 531 mSDsluCounter, 2800 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:46,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 3282 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 2974 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-12 11:09:46,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-07-12 11:09:46,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 435. [2022-07-12 11:09:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 299 states have (on average 1.2508361204013378) internal successors, (374), 302 states have internal predecessors, (374), 95 states have call successors, (95), 35 states have call predecessors, (95), 40 states have return successors, (110), 97 states have call predecessors, (110), 94 states have call successors, (110) [2022-07-12 11:09:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 579 transitions. [2022-07-12 11:09:46,497 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 579 transitions. Word has length 186 [2022-07-12 11:09:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:46,498 INFO L495 AbstractCegarLoop]: Abstraction has 435 states and 579 transitions. [2022-07-12 11:09:46,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 8 states have internal predecessors, (84), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-12 11:09:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 579 transitions. [2022-07-12 11:09:46,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 11:09:46,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:46,500 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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-12 11:09:46,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 11:09:46,500 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:46,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1186597298, now seen corresponding path program 1 times [2022-07-12 11:09:46,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:46,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307792960] [2022-07-12 11:09:46,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:46,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:46,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:46,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:46,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:46,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:46,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:46,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:46,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:09:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:09:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:09:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-12 11:09:46,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:46,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307792960] [2022-07-12 11:09:46,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307792960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:46,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:46,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:09:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770733458] [2022-07-12 11:09:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:46,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:09:46,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:09:46,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:09:46,835 INFO L87 Difference]: Start difference. First operand 435 states and 579 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 11:09:50,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:50,219 INFO L93 Difference]: Finished difference Result 922 states and 1263 transitions. [2022-07-12 11:09:50,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:09:50,219 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 183 [2022-07-12 11:09:50,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:50,222 INFO L225 Difference]: With dead ends: 922 [2022-07-12 11:09:50,222 INFO L226 Difference]: Without dead ends: 574 [2022-07-12 11:09:50,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:09:50,223 INFO L413 NwaCegarLoop]: 533 mSDtfsCounter, 658 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 459 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1806 SdHoareTripleChecker+Invalid, 1952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 459 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:50,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1806 Invalid, 1952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [459 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 11:09:50,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2022-07-12 11:09:50,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 429. [2022-07-12 11:09:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 294 states have (on average 1.248299319727891) internal successors, (367), 298 states have internal predecessors, (367), 94 states have call successors, (94), 35 states have call predecessors, (94), 40 states have return successors, (108), 95 states have call predecessors, (108), 93 states have call successors, (108) [2022-07-12 11:09:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 569 transitions. [2022-07-12 11:09:50,241 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 569 transitions. Word has length 183 [2022-07-12 11:09:50,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:50,241 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 569 transitions. [2022-07-12 11:09:50,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (27), 6 states have call predecessors, (27), 1 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2022-07-12 11:09:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2022-07-12 11:09:50,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-12 11:09:50,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:50,259 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 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-12 11:09:50,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 11:09:50,260 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1223849872, now seen corresponding path program 1 times [2022-07-12 11:09:50,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:50,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845286337] [2022-07-12 11:09:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:50,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:50,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:50,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:50,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:50,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:50,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:50,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:50,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:09:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:09:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:09:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:50,633 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-12 11:09:50,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:50,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845286337] [2022-07-12 11:09:50,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845286337] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:50,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:50,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:09:50,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530882244] [2022-07-12 11:09:50,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:50,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:09:50,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:50,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:09:50,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:09:50,636 INFO L87 Difference]: Start difference. First operand 429 states and 569 transitions. Second operand has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:09:54,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:54,794 INFO L93 Difference]: Finished difference Result 630 states and 860 transitions. [2022-07-12 11:09:54,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:09:54,795 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 183 [2022-07-12 11:09:54,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:54,797 INFO L225 Difference]: With dead ends: 630 [2022-07-12 11:09:54,797 INFO L226 Difference]: Without dead ends: 573 [2022-07-12 11:09:54,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-07-12 11:09:54,798 INFO L413 NwaCegarLoop]: 537 mSDtfsCounter, 543 mSDsluCounter, 2147 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:54,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 2684 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-12 11:09:54,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2022-07-12 11:09:54,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 437. [2022-07-12 11:09:54,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 302 states have (on average 1.2483443708609272) internal successors, (377), 306 states have internal predecessors, (377), 94 states have call successors, (94), 35 states have call predecessors, (94), 40 states have return successors, (108), 95 states have call predecessors, (108), 93 states have call successors, (108) [2022-07-12 11:09:54,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 579 transitions. [2022-07-12 11:09:54,817 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 579 transitions. Word has length 183 [2022-07-12 11:09:54,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:54,818 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 579 transitions. [2022-07-12 11:09:54,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.363636363636363) internal successors, (92), 6 states have internal predecessors, (92), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:09:54,818 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 579 transitions. [2022-07-12 11:09:54,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-12 11:09:54,819 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:54,819 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:09:54,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 11:09:54,819 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:54,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1686982824, now seen corresponding path program 1 times [2022-07-12 11:09:54,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:54,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755706069] [2022-07-12 11:09:54,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:54,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:54,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:54,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:54,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:54,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:54,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:54,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:54,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:54,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:09:55,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:09:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:09:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:09:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-12 11:09:55,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:55,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755706069] [2022-07-12 11:09:55,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755706069] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:55,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:55,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:09:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463709907] [2022-07-12 11:09:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:55,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:09:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:09:55,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:09:55,173 INFO L87 Difference]: Start difference. First operand 437 states and 579 transitions. Second operand has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-12 11:09:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:58,992 INFO L93 Difference]: Finished difference Result 572 states and 764 transitions. [2022-07-12 11:09:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:09:58,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2022-07-12 11:09:58,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:58,995 INFO L225 Difference]: With dead ends: 572 [2022-07-12 11:09:58,995 INFO L226 Difference]: Without dead ends: 517 [2022-07-12 11:09:58,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:09:58,996 INFO L413 NwaCegarLoop]: 448 mSDtfsCounter, 589 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1592 SdHoareTripleChecker+Invalid, 1895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:58,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1592 Invalid, 1895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 1383 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 11:09:58,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-12 11:09:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 442. [2022-07-12 11:09:59,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 306 states have (on average 1.2450980392156863) internal successors, (381), 310 states have internal predecessors, (381), 94 states have call successors, (94), 35 states have call predecessors, (94), 41 states have return successors, (110), 96 states have call predecessors, (110), 93 states have call successors, (110) [2022-07-12 11:09:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 585 transitions. [2022-07-12 11:09:59,018 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 585 transitions. Word has length 187 [2022-07-12 11:09:59,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:59,018 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 585 transitions. [2022-07-12 11:09:59,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.222222222222221) internal successors, (92), 5 states have internal predecessors, (92), 2 states have call successors, (29), 6 states have call predecessors, (29), 2 states have return successors, (28), 2 states have call predecessors, (28), 1 states have call successors, (28) [2022-07-12 11:09:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 585 transitions. [2022-07-12 11:09:59,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-12 11:09:59,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:59,020 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 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-12 11:09:59,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 11:09:59,020 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:59,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:59,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1674366495, now seen corresponding path program 1 times [2022-07-12 11:09:59,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:59,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216047498] [2022-07-12 11:09:59,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:09:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:09:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:09:59,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:09:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:09:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:09:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:09:59,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:09:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:09:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:09:59,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:09:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:09:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:09:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:09:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:09:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:09:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:09:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:09:59,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:09:59,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:09:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-12 11:09:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-12 11:09:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-12 11:09:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-12 11:09:59,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,598 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-12 11:09:59,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:59,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216047498] [2022-07-12 11:09:59,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216047498] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:09:59,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975915668] [2022-07-12 11:09:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:59,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:09:59,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:59,608 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-12 11:09:59,609 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-12 11:10:00,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:00,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 3138 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-12 11:10:00,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:10:00,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 11:10:00,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-12 11:10:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 56 proven. 2 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-12 11:10:00,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:10:00,948 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2022-07-12 11:10:00,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975915668] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:10:00,948 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:10:00,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 13] total 20 [2022-07-12 11:10:00,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524507906] [2022-07-12 11:10:00,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:10:00,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 11:10:00,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:00,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 11:10:00,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2022-07-12 11:10:00,949 INFO L87 Difference]: Start difference. First operand 442 states and 585 transitions. Second operand has 20 states, 17 states have (on average 6.529411764705882) internal successors, (111), 15 states have internal predecessors, (111), 10 states have call successors, (43), 7 states have call predecessors, (43), 5 states have return successors, (35), 6 states have call predecessors, (35), 8 states have call successors, (35) [2022-07-12 11:10:04,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:04,172 INFO L93 Difference]: Finished difference Result 885 states and 1192 transitions. [2022-07-12 11:10:04,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:10:04,172 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.529411764705882) internal successors, (111), 15 states have internal predecessors, (111), 10 states have call successors, (43), 7 states have call predecessors, (43), 5 states have return successors, (35), 6 states have call predecessors, (35), 8 states have call successors, (35) Word has length 190 [2022-07-12 11:10:04,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:04,175 INFO L225 Difference]: With dead ends: 885 [2022-07-12 11:10:04,175 INFO L226 Difference]: Without dead ends: 542 [2022-07-12 11:10:04,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 462 GetRequests, 427 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=844, Unknown=0, NotChecked=0, Total=992 [2022-07-12 11:10:04,187 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 585 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 4230 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 3742 SdHoareTripleChecker+Invalid, 4687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 4230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:04,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 3742 Invalid, 4687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 4230 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 11:10:04,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-07-12 11:10:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 458. [2022-07-12 11:10:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 313 states have (on average 1.2396166134185302) internal successors, (388), 317 states have internal predecessors, (388), 102 states have call successors, (102), 36 states have call predecessors, (102), 42 states have return successors, (116), 104 states have call predecessors, (116), 101 states have call successors, (116) [2022-07-12 11:10:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 606 transitions. [2022-07-12 11:10:04,237 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 606 transitions. Word has length 190 [2022-07-12 11:10:04,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:04,238 INFO L495 AbstractCegarLoop]: Abstraction has 458 states and 606 transitions. [2022-07-12 11:10:04,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.529411764705882) internal successors, (111), 15 states have internal predecessors, (111), 10 states have call successors, (43), 7 states have call predecessors, (43), 5 states have return successors, (35), 6 states have call predecessors, (35), 8 states have call successors, (35) [2022-07-12 11:10:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 606 transitions. [2022-07-12 11:10:04,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-07-12 11:10:04,239 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:04,239 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:10:04,285 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-12 11:10:04,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 11:10:04,453 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:04,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1563869444, now seen corresponding path program 1 times [2022-07-12 11:10:04,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:04,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165064580] [2022-07-12 11:10:04,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:04,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:10:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:10:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:10:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:10:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:10:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:10:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:10:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:10:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:10:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:10:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:10:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:10:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:10:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:10:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:10:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:10:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:10:04,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:10:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:10:04,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:05,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:10:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:05,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:10:05,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-12 11:10:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:05,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-12 11:10:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:05,030 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-12 11:10:05,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:05,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165064580] [2022-07-12 11:10:05,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165064580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:05,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:05,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-12 11:10:05,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394998479] [2022-07-12 11:10:05,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:05,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-12 11:10:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:05,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-12 11:10:05,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:10:05,034 INFO L87 Difference]: Start difference. First operand 458 states and 606 transitions. Second operand has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 9 states have internal predecessors, (88), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-12 11:10:08,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:08,509 INFO L93 Difference]: Finished difference Result 900 states and 1217 transitions. [2022-07-12 11:10:08,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 11:10:08,509 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 9 states have internal predecessors, (88), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) Word has length 190 [2022-07-12 11:10:08,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:08,512 INFO L225 Difference]: With dead ends: 900 [2022-07-12 11:10:08,512 INFO L226 Difference]: Without dead ends: 593 [2022-07-12 11:10:08,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2022-07-12 11:10:08,514 INFO L413 NwaCegarLoop]: 447 mSDtfsCounter, 395 mSDsluCounter, 2776 mSDsCounter, 0 mSdLazyCounter, 3477 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 3223 SdHoareTripleChecker+Invalid, 3655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 3477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:08,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 3223 Invalid, 3655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 3477 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 11:10:08,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2022-07-12 11:10:08,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 479. [2022-07-12 11:10:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 324 states have (on average 1.2345679012345678) internal successors, (400), 328 states have internal predecessors, (400), 110 states have call successors, (110), 38 states have call predecessors, (110), 44 states have return successors, (126), 112 states have call predecessors, (126), 109 states have call successors, (126) [2022-07-12 11:10:08,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 636 transitions. [2022-07-12 11:10:08,535 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 636 transitions. Word has length 190 [2022-07-12 11:10:08,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:08,535 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 636 transitions. [2022-07-12 11:10:08,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.866666666666666) internal successors, (88), 9 states have internal predecessors, (88), 6 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (27), 4 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-12 11:10:08,536 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 636 transitions. [2022-07-12 11:10:08,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-07-12 11:10:08,537 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:08,537 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:10:08,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 11:10:08,537 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:08,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:08,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1811820170, now seen corresponding path program 1 times [2022-07-12 11:10:08,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:08,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167090420] [2022-07-12 11:10:08,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:08,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:08,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:10:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:10:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:10:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:10:08,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:10:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:08,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:08,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:10:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:10:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:10:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:10:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:10:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:10:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:10:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:10:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:10:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:10:08,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:10:08,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:10:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:10:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:10:08,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:10:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:10:08,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:10:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2022-07-12 11:10:08,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:08,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167090420] [2022-07-12 11:10:08,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167090420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:08,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:08,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:10:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497048279] [2022-07-12 11:10:08,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:08,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:10:08,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:08,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:10:08,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:10:08,888 INFO L87 Difference]: Start difference. First operand 479 states and 636 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:10:11,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:11,859 INFO L93 Difference]: Finished difference Result 798 states and 1064 transitions. [2022-07-12 11:10:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:10:11,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) Word has length 185 [2022-07-12 11:10:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:11,862 INFO L225 Difference]: With dead ends: 798 [2022-07-12 11:10:11,862 INFO L226 Difference]: Without dead ends: 556 [2022-07-12 11:10:11,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:10:11,863 INFO L413 NwaCegarLoop]: 451 mSDtfsCounter, 472 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:11,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 1112 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-12 11:10:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-07-12 11:10:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 481. [2022-07-12 11:10:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 326 states have (on average 1.2331288343558282) internal successors, (402), 330 states have internal predecessors, (402), 110 states have call successors, (110), 38 states have call predecessors, (110), 44 states have return successors, (126), 112 states have call predecessors, (126), 109 states have call successors, (126) [2022-07-12 11:10:11,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 638 transitions. [2022-07-12 11:10:11,882 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 638 transitions. Word has length 185 [2022-07-12 11:10:11,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:11,883 INFO L495 AbstractCegarLoop]: Abstraction has 481 states and 638 transitions. [2022-07-12 11:10:11,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (27), 6 states have call predecessors, (27), 2 states have return successors, (26), 2 states have call predecessors, (26), 1 states have call successors, (26) [2022-07-12 11:10:11,883 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 638 transitions. [2022-07-12 11:10:11,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-07-12 11:10:11,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:11,884 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:10:11,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 11:10:11,885 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:11,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:11,885 INFO L85 PathProgramCache]: Analyzing trace with hash -103866992, now seen corresponding path program 1 times [2022-07-12 11:10:11,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:11,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936469571] [2022-07-12 11:10:11,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:11,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:10:12,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:10:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:10:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-12 11:10:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-12 11:10:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:10:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 11:10:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:10:12,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:12,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 11:10:12,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:10:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-12 11:10:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-12 11:10:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-12 11:10:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-12 11:10:12,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-12 11:10:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-12 11:10:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-12 11:10:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-12 11:10:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 11:10:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:10:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 11:10:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-12 11:10:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-12 11:10:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:10:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 11:10:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:12,808 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-07-12 11:10:12,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:12,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936469571] [2022-07-12 11:10:12,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936469571] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:10:12,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937940615] [2022-07-12 11:10:12,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:12,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:10:12,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:10:12,810 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-12 11:10:12,811 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-12 11:10:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:13,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 11:10:13,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:10:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2022-07-12 11:10:13,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 11:10:13,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937940615] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:13,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 11:10:13,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 13 [2022-07-12 11:10:13,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889040615] [2022-07-12 11:10:13,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:13,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:10:13,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:13,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:10:13,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:10:13,789 INFO L87 Difference]: Start difference. First operand 481 states and 638 transitions. Second operand has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-12 11:10:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:14,045 INFO L93 Difference]: Finished difference Result 955 states and 1265 transitions. [2022-07-12 11:10:14,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:10:14,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) Word has length 193 [2022-07-12 11:10:14,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:14,048 INFO L225 Difference]: With dead ends: 955 [2022-07-12 11:10:14,048 INFO L226 Difference]: Without dead ends: 483 [2022-07-12 11:10:14,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:10:14,050 INFO L413 NwaCegarLoop]: 439 mSDtfsCounter, 91 mSDsluCounter, 1671 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 2110 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:14,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 2110 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:10:14,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2022-07-12 11:10:14,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2022-07-12 11:10:14,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 327 states have (on average 1.2324159021406729) internal successors, (403), 332 states have internal predecessors, (403), 110 states have call successors, (110), 38 states have call predecessors, (110), 45 states have return successors, (127), 112 states have call predecessors, (127), 109 states have call successors, (127) [2022-07-12 11:10:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 640 transitions. [2022-07-12 11:10:14,073 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 640 transitions. Word has length 193 [2022-07-12 11:10:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:14,073 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 640 transitions. [2022-07-12 11:10:14,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.142857142857142) internal successors, (106), 7 states have internal predecessors, (106), 4 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 4 states have call predecessors, (29), 4 states have call successors, (29) [2022-07-12 11:10:14,074 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 640 transitions. [2022-07-12 11:10:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-12 11:10:14,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:14,075 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 11:10:14,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 11:10:14,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:10:14,298 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:14,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:14,299 INFO L85 PathProgramCache]: Analyzing trace with hash 2131388023, now seen corresponding path program 1 times [2022-07-12 11:10:14,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:14,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357551161] [2022-07-12 11:10:14,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:14,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:14,361 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-12 11:10:14,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1214449500] [2022-07-12 11:10:14,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:14,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:10:14,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:10:14,363 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-12 11:10:14,364 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-12 11:10:15,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:15,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 3324 conjuncts, 283 conjunts are in the unsatisfiable core [2022-07-12 11:10:15,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:10:15,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-12 11:10:15,756 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 11:10:15,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-12 11:10:15,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:10:16,040 INFO L356 Elim1Store]: treesize reduction 112, result has 28.7 percent of original size [2022-07-12 11:10:16,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 142 treesize of output 166 [2022-07-12 11:10:16,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 11:10:16,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:10:16,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:10:16,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 11:10:16,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 11:10:16,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-12 11:10:16,844 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-12 11:10:16,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-12 11:10:16,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:10:16,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 11:10:17,142 INFO L356 Elim1Store]: treesize reduction 102, result has 17.1 percent of original size [2022-07-12 11:10:17,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:17,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357551161] [2022-07-12 11:10:17,145 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-12 11:10:17,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214449500] [2022-07-12 11:10:17,145 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-12 11:10:17,197 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-12 11:10:17,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:10:17,346 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_184| input size 111 context size 111 output size 111 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:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java: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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java: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-12 11:10:17,348 INFO L158 Benchmark]: Toolchain (without parser) took 77914.62ms. Allocated memory was 98.6MB in the beginning and 859.8MB in the end (delta: 761.3MB). Free memory was 55.6MB in the beginning and 349.7MB in the end (delta: -294.2MB). Peak memory consumption was 465.5MB. Max. memory is 16.1GB. [2022-07-12 11:10:17,348 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:10:17,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1890.08ms. Allocated memory was 98.6MB in the beginning and 199.2MB in the end (delta: 100.7MB). Free memory was 55.4MB in the beginning and 121.6MB in the end (delta: -66.1MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. [2022-07-12 11:10:17,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.68ms. Allocated memory is still 199.2MB. Free memory was 121.6MB in the beginning and 106.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 11:10:17,349 INFO L158 Benchmark]: Boogie Preprocessor took 94.57ms. Allocated memory is still 199.2MB. Free memory was 106.9MB in the beginning and 95.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 11:10:17,349 INFO L158 Benchmark]: RCFGBuilder took 1663.39ms. Allocated memory is still 199.2MB. Free memory was 95.4MB in the beginning and 105.9MB in the end (delta: -10.5MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. [2022-07-12 11:10:17,349 INFO L158 Benchmark]: TraceAbstraction took 74096.89ms. Allocated memory was 199.2MB in the beginning and 859.8MB in the end (delta: 660.6MB). Free memory was 105.9MB in the beginning and 349.7MB in the end (delta: -243.9MB). Peak memory consumption was 415.7MB. Max. memory is 16.1GB. [2022-07-12 11:10:17,350 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 98.6MB. Free memory was 53.2MB in the beginning and 53.2MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1890.08ms. Allocated memory was 98.6MB in the beginning and 199.2MB in the end (delta: 100.7MB). Free memory was 55.4MB in the beginning and 121.6MB in the end (delta: -66.1MB). Peak memory consumption was 71.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.68ms. Allocated memory is still 199.2MB. Free memory was 121.6MB in the beginning and 106.9MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.57ms. Allocated memory is still 199.2MB. Free memory was 106.9MB in the beginning and 95.4MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1663.39ms. Allocated memory is still 199.2MB. Free memory was 95.4MB in the beginning and 105.9MB in the end (delta: -10.5MB). Peak memory consumption was 40.9MB. Max. memory is 16.1GB. * TraceAbstraction took 74096.89ms. Allocated memory was 199.2MB in the beginning and 859.8MB in the end (delta: 660.6MB). Free memory was 105.9MB in the beginning and 349.7MB in the end (delta: -243.9MB). Peak memory consumption was 415.7MB. 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_184| input size 111 context size 111 output size 111 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#memory_$Pointer$.base_184| input size 111 context size 111 output size 111: 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-12 11:10:17,501 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_put_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 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:10:19,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:10:19,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:10:19,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:10:19,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:10:19,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:10:19,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:10:19,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:10:19,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:10:19,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:10:19,250 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:10:19,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:10:19,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:10:19,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:10:19,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:10:19,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:10:19,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:10:19,260 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:10:19,261 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:10:19,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:10:19,268 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:10:19,268 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:10:19,269 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:10:19,270 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:10:19,270 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:10:19,273 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:10:19,273 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:10:19,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:10:19,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:10:19,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:10:19,275 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:10:19,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:10:19,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:10:19,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:10:19,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:10:19,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:10:19,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:10:19,279 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:10:19,279 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:10:19,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:10:19,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:10:19,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:10:19,282 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-07-12 11:10:19,309 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:10:19,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:10:19,310 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:10:19,310 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:10:19,311 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:10:19,311 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:10:19,311 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:10:19,311 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:10:19,311 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:10:19,312 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:10:19,312 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:10:19,312 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:10:19,313 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:10:19,313 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:10:19,313 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 11:10:19,313 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 11:10:19,313 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 11:10:19,313 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:10:19,313 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:10:19,314 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:10:19,314 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:10:19,314 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:10:19,314 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:10:19,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:10:19,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:10:19,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:10:19,315 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:10:19,315 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 11:10:19,315 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 11:10:19,315 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:10:19,315 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:10:19,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:10:19,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 11:10:19,316 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 -> 7e3410638a547f2efce35a13c7d23c64ee660b1c493ec273ce9d4043edc218c3 [2022-07-12 11:10:19,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:10:19,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:10:19,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:10:19,585 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:10:19,586 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:10:19,587 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_put_harness.i [2022-07-12 11:10:19,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd883bad7/26a7fd623e344a39aaa0003341364ada/FLAGb7960b65a [2022-07-12 11:10:20,253 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:10:20,254 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_hash_table_put_harness.i [2022-07-12 11:10:20,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd883bad7/26a7fd623e344a39aaa0003341364ada/FLAGb7960b65a [2022-07-12 11:10:20,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd883bad7/26a7fd623e344a39aaa0003341364ada [2022-07-12 11:10:20,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:10:20,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:10:20,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:10:20,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:10:20,671 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:10:20,671 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:10:20" (1/1) ... [2022-07-12 11:10:20,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a045e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:10:20, skipping insertion in model container [2022-07-12 11:10:20,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:10:20" (1/1) ... [2022-07-12 11:10:20,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:10:20,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:10:21,020 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_put_harness.i[4492,4505] [2022-07-12 11:10:21,025 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_put_harness.i[4552,4565] [2022-07-12 11:10:21,750 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,751 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,752 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,752 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,753 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,771 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,777 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,779 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,779 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,780 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,781 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,781 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:21,781 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:10:22,013 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:10:22,014 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:10:22,015 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:10:22,015 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:10:22,016 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:10:22,016 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:10:22,017 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:10:22,017 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:10:22,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:10:22,018 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:10:22,106 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:10:22,122 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-12 11:10:22,126 INFO L158 Benchmark]: Toolchain (without parser) took 1457.28ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 25.2MB in the beginning and 44.6MB in the end (delta: -19.4MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-07-12 11:10:22,126 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 11:10:22,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1455.87ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 25.1MB in the beginning and 44.6MB in the end (delta: -19.5MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-07-12 11:10:22,128 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 38.7MB in the beginning and 38.7MB in the end (delta: 50.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1455.87ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 25.1MB in the beginning and 44.6MB in the end (delta: -19.5MB). Peak memory consumption was 13.2MB. 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