./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_init_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_linked_list_init_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 5b917a1c951859368fb2463a158063964361d86aeab261c924186dc34055576d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 11:09:54,962 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 11:09:54,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 11:09:55,008 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 11:09:55,009 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 11:09:55,009 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 11:09:55,010 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 11:09:55,012 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 11:09:55,013 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 11:09:55,017 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 11:09:55,018 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 11:09:55,020 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 11:09:55,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 11:09:55,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 11:09:55,023 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 11:09:55,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 11:09:55,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 11:09:55,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 11:09:55,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 11:09:55,036 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 11:09:55,038 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 11:09:55,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 11:09:55,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 11:09:55,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 11:09:55,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 11:09:55,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 11:09:55,055 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 11:09:55,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 11:09:55,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 11:09:55,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 11:09:55,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 11:09:55,059 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 11:09:55,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 11:09:55,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 11:09:55,061 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 11:09:55,062 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 11:09:55,062 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 11:09:55,063 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 11:09:55,063 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 11:09:55,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 11:09:55,064 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 11:09:55,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 11:09:55,067 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:09:55,092 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 11:09:55,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 11:09:55,093 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 11:09:55,094 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 11:09:55,094 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 11:09:55,094 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 11:09:55,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 11:09:55,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 11:09:55,095 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 11:09:55,096 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 11:09:55,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 11:09:55,097 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 11:09:55,097 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 11:09:55,097 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 11:09:55,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 11:09:55,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 11:09:55,098 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 11:09:55,098 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 11:09:55,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 11:09:55,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 11:09:55,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 11:09:55,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:09:55,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 11:09:55,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 11:09:55,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 11:09:55,100 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 11:09:55,100 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 11:09:55,100 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 11:09:55,100 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 11:09:55,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 11:09:55,101 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 -> 5b917a1c951859368fb2463a158063964361d86aeab261c924186dc34055576d [2022-07-12 11:09:55,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 11:09:55,332 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 11:09:55,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 11:09:55,335 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 11:09:55,337 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 11:09:55,338 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2022-07-12 11:09:55,391 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e810a844/0b23bdaf05b8452c90af8512a8c1adb7/FLAGa77b20cd3 [2022-07-12 11:09:55,948 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 11:09:55,948 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i [2022-07-12 11:09:55,981 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e810a844/0b23bdaf05b8452c90af8512a8c1adb7/FLAGa77b20cd3 [2022-07-12 11:09:56,149 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e810a844/0b23bdaf05b8452c90af8512a8c1adb7 [2022-07-12 11:09:56,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 11:09:56,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 11:09:56,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 11:09:56,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 11:09:56,163 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 11:09:56,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:09:56" (1/1) ... [2022-07-12 11:09:56,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e81ef89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:56, skipping insertion in model container [2022-07-12 11:09:56,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 11:09:56" (1/1) ... [2022-07-12 11:09:56,170 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 11:09:56,253 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 11:09:56,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4494,4507] [2022-07-12 11:09:56,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4554,4567] [2022-07-12 11:09:56,962 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,963 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,964 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,965 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,966 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,977 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,977 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,979 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,979 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,981 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,982 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,983 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:56,983 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,242 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:09:57,246 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:09:57,248 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:09:57,250 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:09:57,251 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:09:57,252 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:09:57,252 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:09:57,253 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:09:57,253 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:09:57,263 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:09:57,351 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:09:57,377 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:09:57,392 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 11:09:57,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4494,4507] [2022-07-12 11:09:57,426 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_init_harness.i[4554,4567] [2022-07-12 11:09:57,456 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,456 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,457 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,457 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,458 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,463 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,464 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,469 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,469 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,470 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,471 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,471 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,471 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-12 11:09:57,521 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-12 11:09:57,524 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-12 11:09:57,526 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-12 11:09:57,527 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-12 11:09:57,533 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-12 11:09:57,534 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-12 11:09:57,534 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-12 11:09:57,535 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-12 11:09:57,535 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-12 11:09:57,536 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-12 11:09:57,565 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-12 11:09:57,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 11:09:57,766 INFO L208 MainTranslator]: Completed translation [2022-07-12 11:09:57,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:57 WrapperNode [2022-07-12 11:09:57,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 11:09:57,768 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 11:09:57,768 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 11:09:57,768 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 11:09:57,774 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:57" (1/1) ... [2022-07-12 11:09:57,860 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:57" (1/1) ... [2022-07-12 11:09:57,906 INFO L137 Inliner]: procedures = 679, calls = 1036, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 93 [2022-07-12 11:09:57,908 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 11:09:57,908 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 11:09:57,908 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 11:09:57,908 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 11:09:57,916 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:57" (1/1) ... [2022-07-12 11:09:57,916 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:57" (1/1) ... [2022-07-12 11:09:57,931 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:57" (1/1) ... [2022-07-12 11:09:57,932 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:57" (1/1) ... [2022-07-12 11:09:57,942 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:57" (1/1) ... [2022-07-12 11:09:57,951 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:57" (1/1) ... [2022-07-12 11:09:57,955 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:57" (1/1) ... [2022-07-12 11:09:57,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 11:09:57,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 11:09:57,973 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 11:09:57,973 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 11:09:57,974 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:57" (1/1) ... [2022-07-12 11:09:57,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 11:09:57,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:09:58,006 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:58,011 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:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_init [2022-07-12 11:09:58,050 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_init [2022-07-12 11:09:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 11:09:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-12 11:09:58,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-12 11:09:58,051 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-07-12 11:09:58,051 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-07-12 11:09:58,052 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2022-07-12 11:09:58,052 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2022-07-12 11:09:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 11:09:58,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 11:09:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 11:09:58,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 11:09:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_empty [2022-07-12 11:09:58,054 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_empty [2022-07-12 11:09:58,054 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-12 11:09:58,054 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-12 11:09:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 11:09:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 11:09:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 11:09:58,055 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 11:09:58,289 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 11:09:58,290 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 11:09:58,484 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 11:09:58,494 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 11:09:58,498 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 11:09:58,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:09:58 BoogieIcfgContainer [2022-07-12 11:09:58,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 11:09:58,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 11:09:58,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 11:09:58,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 11:09:58,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 11:09:56" (1/3) ... [2022-07-12 11:09:58,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee20cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:09:58, skipping insertion in model container [2022-07-12 11:09:58,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 11:09:57" (2/3) ... [2022-07-12 11:09:58,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ee20cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 11:09:58, skipping insertion in model container [2022-07-12 11:09:58,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 11:09:58" (3/3) ... [2022-07-12 11:09:58,526 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_init_harness.i [2022-07-12 11:09:58,539 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 11:09:58,539 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 11:09:58,585 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 11:09:58,591 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@2e7105cd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15a26f86 [2022-07-12 11:09:58,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 11:09:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-12 11:09:58,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 11:09:58,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:58,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 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:58,603 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:58,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:58,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1017333715, now seen corresponding path program 1 times [2022-07-12 11:09:58,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:58,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705837187] [2022-07-12 11:09:58,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:58,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:09:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:58,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:09:58,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:58,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705837187] [2022-07-12 11:09:58,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705837187] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:58,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:58,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 11:09:58,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570386289] [2022-07-12 11:09:58,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:58,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 11:09:58,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:59,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 11:09:59,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 11:09:59,030 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3488372093023255) internal successors, (58), 44 states have internal predecessors, (58), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:09:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:59,060 INFO L93 Difference]: Finished difference Result 117 states and 158 transitions. [2022-07-12 11:09:59,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 11:09:59,062 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-12 11:09:59,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:59,072 INFO L225 Difference]: With dead ends: 117 [2022-07-12 11:09:59,073 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 11:09:59,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 11:09:59,085 INFO L413 NwaCegarLoop]: 75 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, 75 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:59,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 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:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 11:09:59,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-12 11:09:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 40 states have internal predecessors, (51), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-07-12 11:09:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-07-12 11:09:59,139 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 26 [2022-07-12 11:09:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:59,141 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-07-12 11:09:59,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:09:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-07-12 11:09:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 11:09:59,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:59,145 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 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,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 11:09:59,149 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:59,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:59,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1834982165, now seen corresponding path program 1 times [2022-07-12 11:09:59,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:59,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198129189] [2022-07-12 11:09:59,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:59,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:59,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:09:59,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:09:59,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:59,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198129189] [2022-07-12 11:09:59,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198129189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:59,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:59,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:09:59,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618259507] [2022-07-12 11:09:59,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:59,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:09:59,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:59,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:09:59,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:09:59,530 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:09:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:09:59,712 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2022-07-12 11:09:59,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:09:59,713 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-12 11:09:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:09:59,715 INFO L225 Difference]: With dead ends: 108 [2022-07-12 11:09:59,715 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 11:09:59,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:09:59,717 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:09:59,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 320 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:09:59,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 11:09:59,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-12 11:09:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 43 states have internal predecessors, (54), 10 states have call successors, (10), 6 states have call predecessors, (10), 7 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-12 11:09:59,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 74 transitions. [2022-07-12 11:09:59,727 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 74 transitions. Word has length 26 [2022-07-12 11:09:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:09:59,727 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 74 transitions. [2022-07-12 11:09:59,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:09:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 74 transitions. [2022-07-12 11:09:59,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 11:09:59,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:09:59,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 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,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 11:09:59,729 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:09:59,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:09:59,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1650638505, now seen corresponding path program 1 times [2022-07-12 11:09:59,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:09:59,730 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64163333] [2022-07-12 11:09:59,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:09:59,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:09:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:09:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:09:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:09:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:09:59,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:09:59,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64163333] [2022-07-12 11:09:59,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64163333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:09:59,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:09:59,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:09:59,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760297538] [2022-07-12 11:09:59,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:09:59,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:09:59,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:09:59,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:09:59,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:09:59,932 INFO L87 Difference]: Start difference. First operand 59 states and 74 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:10:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:00,199 INFO L93 Difference]: Finished difference Result 124 states and 161 transitions. [2022-07-12 11:10:00,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:10:00,200 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-12 11:10:00,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:00,201 INFO L225 Difference]: With dead ends: 124 [2022-07-12 11:10:00,201 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 11:10:00,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:10:00,203 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 77 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:00,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 409 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:10:00,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 11:10:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-12 11:10:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 50 states have (on average 1.38) internal successors, (69), 52 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-12 11:10:00,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2022-07-12 11:10:00,212 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 26 [2022-07-12 11:10:00,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:00,212 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2022-07-12 11:10:00,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:10:00,213 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2022-07-12 11:10:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 11:10:00,214 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:00,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 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:00,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 11:10:00,214 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:00,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:00,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1257611495, now seen corresponding path program 1 times [2022-07-12 11:10:00,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:00,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109125254] [2022-07-12 11:10:00,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:00,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:00,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:00,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:00,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:00,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:00,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109125254] [2022-07-12 11:10:00,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109125254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:00,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:00,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:10:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497389899] [2022-07-12 11:10:00,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:00,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:10:00,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:00,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:10:00,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:10:00,384 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:10:00,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:00,648 INFO L93 Difference]: Finished difference Result 152 states and 207 transitions. [2022-07-12 11:10:00,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:10:00,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-12 11:10:00,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:00,651 INFO L225 Difference]: With dead ends: 152 [2022-07-12 11:10:00,651 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 11:10:00,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:10:00,652 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 87 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:00,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 375 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:10:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 11:10:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 73. [2022-07-12 11:10:00,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 56 states have internal predecessors, (75), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-12 11:10:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2022-07-12 11:10:00,663 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 26 [2022-07-12 11:10:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:00,663 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2022-07-12 11:10:00,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:10:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2022-07-12 11:10:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 11:10:00,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:00,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 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:00,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 11:10:00,665 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1515776933, now seen corresponding path program 1 times [2022-07-12 11:10:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:00,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135883264] [2022-07-12 11:10:00,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:00,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:00,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:00,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:00,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:00,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135883264] [2022-07-12 11:10:00,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135883264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:00,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:00,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 11:10:00,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454839796] [2022-07-12 11:10:00,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:00,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 11:10:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:00,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 11:10:00,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 11:10:00,855 INFO L87 Difference]: Start difference. First operand 73 states and 97 transitions. Second operand has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:10:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:01,070 INFO L93 Difference]: Finished difference Result 176 states and 245 transitions. [2022-07-12 11:10:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:10:01,071 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2022-07-12 11:10:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:01,072 INFO L225 Difference]: With dead ends: 176 [2022-07-12 11:10:01,072 INFO L226 Difference]: Without dead ends: 110 [2022-07-12 11:10:01,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:10:01,074 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 75 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:01,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 480 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:10:01,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-12 11:10:01,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 77. [2022-07-12 11:10:01,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.396551724137931) internal successors, (81), 60 states have internal predecessors, (81), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-12 11:10:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 103 transitions. [2022-07-12 11:10:01,086 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 103 transitions. Word has length 26 [2022-07-12 11:10:01,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:01,086 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 103 transitions. [2022-07-12 11:10:01,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-12 11:10:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 103 transitions. [2022-07-12 11:10:01,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 11:10:01,088 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:01,088 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 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:01,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 11:10:01,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:01,089 INFO L85 PathProgramCache]: Analyzing trace with hash 504659683, now seen corresponding path program 1 times [2022-07-12 11:10:01,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:01,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755043165] [2022-07-12 11:10:01,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:01,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755043165] [2022-07-12 11:10:01,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755043165] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:01,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:01,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 11:10:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079272077] [2022-07-12 11:10:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:01,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 11:10:01,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 11:10:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:10:01,191 INFO L87 Difference]: Start difference. First operand 77 states and 103 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 11:10:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:01,249 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2022-07-12 11:10:01,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 11:10:01,250 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-07-12 11:10:01,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:01,251 INFO L225 Difference]: With dead ends: 173 [2022-07-12 11:10:01,251 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 11:10:01,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:10:01,252 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 45 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:01,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 380 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:10:01,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 11:10:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-07-12 11:10:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3529411764705883) internal successors, (69), 53 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-12 11:10:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 91 transitions. [2022-07-12 11:10:01,259 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 91 transitions. Word has length 26 [2022-07-12 11:10:01,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:01,259 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 91 transitions. [2022-07-12 11:10:01,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 11:10:01,260 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 91 transitions. [2022-07-12 11:10:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-12 11:10:01,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:01,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 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:01,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 11:10:01,261 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:01,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1687611897, now seen corresponding path program 1 times [2022-07-12 11:10:01,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:01,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862685682] [2022-07-12 11:10:01,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:01,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:01,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:01,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:01,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862685682] [2022-07-12 11:10:01,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862685682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:01,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:01,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:10:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932545174] [2022-07-12 11:10:01,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:01,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:10:01,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:01,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:10:01,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:10:01,370 INFO L87 Difference]: Start difference. First operand 70 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 11:10:01,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:01,492 INFO L93 Difference]: Finished difference Result 141 states and 182 transitions. [2022-07-12 11:10:01,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:10:01,493 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-07-12 11:10:01,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:01,494 INFO L225 Difference]: With dead ends: 141 [2022-07-12 11:10:01,494 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 11:10:01,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:10:01,497 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 38 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:01,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 319 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:10:01,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 11:10:01,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-07-12 11:10:01,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 53 states have internal predecessors, (67), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-12 11:10:01,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 89 transitions. [2022-07-12 11:10:01,515 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 89 transitions. Word has length 28 [2022-07-12 11:10:01,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:01,516 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 89 transitions. [2022-07-12 11:10:01,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 11:10:01,516 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 89 transitions. [2022-07-12 11:10:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 11:10:01,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:01,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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:01,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 11:10:01,522 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:01,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:01,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1850407916, now seen corresponding path program 1 times [2022-07-12 11:10:01,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:01,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027604172] [2022-07-12 11:10:01,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:01,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:01,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:01,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:01,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027604172] [2022-07-12 11:10:01,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027604172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:01,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:01,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 11:10:01,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219895535] [2022-07-12 11:10:01,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:01,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 11:10:01,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:01,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 11:10:01,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 11:10:01,648 INFO L87 Difference]: Start difference. First operand 70 states and 89 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 11:10:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:01,794 INFO L93 Difference]: Finished difference Result 159 states and 205 transitions. [2022-07-12 11:10:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 11:10:01,795 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-07-12 11:10:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:01,796 INFO L225 Difference]: With dead ends: 159 [2022-07-12 11:10:01,796 INFO L226 Difference]: Without dead ends: 88 [2022-07-12 11:10:01,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2022-07-12 11:10:01,797 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 64 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:01,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:10:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-12 11:10:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2022-07-12 11:10:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 55 states have internal predecessors, (69), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-12 11:10:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2022-07-12 11:10:01,804 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 30 [2022-07-12 11:10:01,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:01,804 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2022-07-12 11:10:01,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 11:10:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-07-12 11:10:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 11:10:01,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:01,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 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:01,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 11:10:01,806 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:01,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:01,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1395309347, now seen corresponding path program 1 times [2022-07-12 11:10:01,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:01,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399899559] [2022-07-12 11:10:01,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:01,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:01,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:01,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:01,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399899559] [2022-07-12 11:10:01,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399899559] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:01,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:01,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 11:10:01,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857436402] [2022-07-12 11:10:01,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:01,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 11:10:01,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:01,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 11:10:01,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 11:10:01,877 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 11:10:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:01,938 INFO L93 Difference]: Finished difference Result 149 states and 195 transitions. [2022-07-12 11:10:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 11:10:01,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-07-12 11:10:01,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:01,941 INFO L225 Difference]: With dead ends: 149 [2022-07-12 11:10:01,941 INFO L226 Difference]: Without dead ends: 84 [2022-07-12 11:10:01,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-12 11:10:01,943 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 12 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:01,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 276 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:10:01,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-12 11:10:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2022-07-12 11:10:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 55 states have (on average 1.290909090909091) internal successors, (71), 57 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 7 states have return successors, (11), 10 states have call predecessors, (11), 10 states have call successors, (11) [2022-07-12 11:10:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2022-07-12 11:10:01,953 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 31 [2022-07-12 11:10:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:01,954 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2022-07-12 11:10:01,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-12 11:10:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2022-07-12 11:10:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 11:10:01,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:01,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 11:10:01,956 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:01,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1854431003, now seen corresponding path program 1 times [2022-07-12 11:10:01,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:01,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062764783] [2022-07-12 11:10:01,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:01,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:01,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:02,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:02,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:10:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:02,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:02,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:02,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062764783] [2022-07-12 11:10:02,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062764783] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:02,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:02,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:10:02,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009345825] [2022-07-12 11:10:02,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:02,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:10:02,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:02,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:10:02,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:10:02,399 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 11:10:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:02,847 INFO L93 Difference]: Finished difference Result 164 states and 211 transitions. [2022-07-12 11:10:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 11:10:02,848 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2022-07-12 11:10:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:02,849 INFO L225 Difference]: With dead ends: 164 [2022-07-12 11:10:02,849 INFO L226 Difference]: Without dead ends: 97 [2022-07-12 11:10:02,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-12 11:10:02,850 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 59 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:02,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 482 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:10:02,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-12 11:10:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 79. [2022-07-12 11:10:02,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.293103448275862) internal successors, (75), 61 states have internal predecessors, (75), 12 states have call successors, (12), 6 states have call predecessors, (12), 8 states have return successors, (15), 11 states have call predecessors, (15), 11 states have call successors, (15) [2022-07-12 11:10:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 102 transitions. [2022-07-12 11:10:02,859 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 102 transitions. Word has length 39 [2022-07-12 11:10:02,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:02,859 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 102 transitions. [2022-07-12 11:10:02,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 11:10:02,859 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 102 transitions. [2022-07-12 11:10:02,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 11:10:02,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:02,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 11:10:02,860 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:02,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:02,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1596265565, now seen corresponding path program 1 times [2022-07-12 11:10:02,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:02,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872399509] [2022-07-12 11:10:02,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:02,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:02,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:02,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:10:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:03,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:03,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872399509] [2022-07-12 11:10:03,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872399509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:03,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:03,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-12 11:10:03,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487724193] [2022-07-12 11:10:03,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:03,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-12 11:10:03,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:03,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-12 11:10:03,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-12 11:10:03,060 INFO L87 Difference]: Start difference. First operand 79 states and 102 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 11:10:03,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:03,422 INFO L93 Difference]: Finished difference Result 192 states and 261 transitions. [2022-07-12 11:10:03,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 11:10:03,423 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 39 [2022-07-12 11:10:03,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:03,424 INFO L225 Difference]: With dead ends: 192 [2022-07-12 11:10:03,424 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 11:10:03,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-07-12 11:10:03,425 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:03,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 519 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:10:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 11:10:03,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 84. [2022-07-12 11:10:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 66 states have internal predecessors, (80), 12 states have call successors, (12), 6 states have call predecessors, (12), 9 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-07-12 11:10:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 110 transitions. [2022-07-12 11:10:03,434 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 110 transitions. Word has length 39 [2022-07-12 11:10:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:03,434 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 110 transitions. [2022-07-12 11:10:03,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-12 11:10:03,435 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 110 transitions. [2022-07-12 11:10:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 11:10:03,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:03,435 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 11:10:03,436 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:03,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:03,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1687584481, now seen corresponding path program 1 times [2022-07-12 11:10:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:03,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394417824] [2022-07-12 11:10:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:03,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:03,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:10:03,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:03,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:03,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:03,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394417824] [2022-07-12 11:10:03,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394417824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:03,561 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:03,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:10:03,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902174129] [2022-07-12 11:10:03,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:10:03,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:03,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:10:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:10:03,563 INFO L87 Difference]: Start difference. First operand 84 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 11:10:03,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:03,771 INFO L93 Difference]: Finished difference Result 201 states and 278 transitions. [2022-07-12 11:10:03,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 11:10:03,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-07-12 11:10:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:03,772 INFO L225 Difference]: With dead ends: 201 [2022-07-12 11:10:03,772 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 11:10:03,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:10:03,773 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:03,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 465 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 11:10:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 11:10:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 85. [2022-07-12 11:10:03,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 67 states have internal predecessors, (80), 13 states have call successors, (13), 6 states have call predecessors, (13), 9 states have return successors, (19), 11 states have call predecessors, (19), 12 states have call successors, (19) [2022-07-12 11:10:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2022-07-12 11:10:03,781 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 39 [2022-07-12 11:10:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:03,781 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2022-07-12 11:10:03,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-12 11:10:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2022-07-12 11:10:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 11:10:03,782 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:03,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 11:10:03,783 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:03,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:03,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1045188466, now seen corresponding path program 1 times [2022-07-12 11:10:03,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:03,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916290538] [2022-07-12 11:10:03,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:03,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:03,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:03,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:03,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:10:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:03,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:03,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916290538] [2022-07-12 11:10:03,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916290538] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:10:03,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348961878] [2022-07-12 11:10:03,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:03,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:10:03,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:10:03,939 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:10:03,982 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:10:04,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:04,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 11:10:04,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:10:05,152 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1| Int) (|v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.base_BEFORE_CALL_1|) |v_aws_linked_list_is_valid_aws_linked_list_is_valid_deep_~temp~0#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2022-07-12 11:10:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:05,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:10:05,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:05,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348961878] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:10:05,495 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:10:05,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 8] total 27 [2022-07-12 11:10:05,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942268883] [2022-07-12 11:10:05,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:10:05,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-12 11:10:05,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:05,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-12 11:10:05,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=586, Unknown=1, NotChecked=48, Total=702 [2022-07-12 11:10:05,497 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand has 27 states, 24 states have (on average 3.125) internal successors, (75), 25 states have internal predecessors, (75), 10 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 11:10:06,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:06,465 INFO L93 Difference]: Finished difference Result 233 states and 321 transitions. [2022-07-12 11:10:06,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 11:10:06,466 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 3.125) internal successors, (75), 25 states have internal predecessors, (75), 10 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 41 [2022-07-12 11:10:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:06,467 INFO L225 Difference]: With dead ends: 233 [2022-07-12 11:10:06,467 INFO L226 Difference]: Without dead ends: 155 [2022-07-12 11:10:06,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=188, Invalid=1455, Unknown=1, NotChecked=78, Total=1722 [2022-07-12 11:10:06,468 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 204 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 1204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 197 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:06,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 943 Invalid, 1204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 928 Invalid, 0 Unknown, 197 Unchecked, 0.6s Time] [2022-07-12 11:10:06,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-12 11:10:06,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 102. [2022-07-12 11:10:06,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.2987012987012987) internal successors, (100), 82 states have internal predecessors, (100), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 12 states have call predecessors, (21), 13 states have call successors, (21) [2022-07-12 11:10:06,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 135 transitions. [2022-07-12 11:10:06,479 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 135 transitions. Word has length 41 [2022-07-12 11:10:06,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:06,479 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 135 transitions. [2022-07-12 11:10:06,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 3.125) internal successors, (75), 25 states have internal predecessors, (75), 10 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-07-12 11:10:06,479 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 135 transitions. [2022-07-12 11:10:06,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 11:10:06,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:06,480 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:10:06,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 11:10:06,703 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,SelfDestructingSolverStorable12 [2022-07-12 11:10:06,704 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:06,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:06,704 INFO L85 PathProgramCache]: Analyzing trace with hash 964483973, now seen corresponding path program 1 times [2022-07-12 11:10:06,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:06,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530735433] [2022-07-12 11:10:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:06,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:06,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:06,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:06,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:10:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 11:10:06,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:06,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530735433] [2022-07-12 11:10:06,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530735433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:10:06,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:10:06,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:10:06,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617945565] [2022-07-12 11:10:06,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:10:06,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:10:06,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:06,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:10:06,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:10:06,817 INFO L87 Difference]: Start difference. First operand 102 states and 135 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 11:10:06,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:10:06,876 INFO L93 Difference]: Finished difference Result 118 states and 152 transitions. [2022-07-12 11:10:06,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:10:06,876 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-07-12 11:10:06,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:10:06,878 INFO L225 Difference]: With dead ends: 118 [2022-07-12 11:10:06,878 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 11:10:06,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:10:06,879 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 10 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:10:06,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 452 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:10:06,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 11:10:06,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2022-07-12 11:10:06,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.2771084337349397) internal successors, (106), 89 states have internal predecessors, (106), 15 states have call successors, (15), 8 states have call predecessors, (15), 12 states have return successors, (24), 13 states have call predecessors, (24), 14 states have call successors, (24) [2022-07-12 11:10:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 145 transitions. [2022-07-12 11:10:06,892 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 145 transitions. Word has length 42 [2022-07-12 11:10:06,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:10:06,893 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 145 transitions. [2022-07-12 11:10:06,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-12 11:10:06,893 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 145 transitions. [2022-07-12 11:10:06,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 11:10:06,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:10:06,894 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 11:10:06,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 11:10:06,894 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:10:06,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:10:06,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1440497479, now seen corresponding path program 1 times [2022-07-12 11:10:06,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:10:06,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372410537] [2022-07-12 11:10:06,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:06,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:10:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:06,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:10:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:06,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:10:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:10:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:07,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:10:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:07,151 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 11:10:07,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:10:07,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372410537] [2022-07-12 11:10:07,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372410537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:10:07,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490582137] [2022-07-12 11:10:07,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:10:07,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:10:07,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:10:07,154 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:10:07,163 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:10:07,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:10:07,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 11:10:07,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:10:07,353 INFO L356 Elim1Store]: treesize reduction 157, result has 14.2 percent of original size [2022-07-12 11:10:07,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 35 [2022-07-12 11:10:07,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:10:07,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:10:07,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:10:07,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:10:07,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:10:07,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:10:07,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2022-07-12 11:10:50,318 WARN L233 SmtUtils]: Spent 10.05s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:10:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 11:10:50,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:10:50,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-12 11:10:50,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490582137] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:10:50,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:10:50,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 8] total 25 [2022-07-12 11:10:50,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891267100] [2022-07-12 11:10:50,924 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:10:50,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 11:10:50,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:10:50,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 11:10:50,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=505, Unknown=13, NotChecked=0, Total=600 [2022-07-12 11:10:50,926 INFO L87 Difference]: Start difference. First operand 111 states and 145 transitions. Second operand has 25 states, 23 states have (on average 3.869565217391304) internal successors, (89), 25 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-12 11:11:11,345 WARN L233 SmtUtils]: Spent 10.08s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:11:23,401 WARN L233 SmtUtils]: Spent 10.04s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:11:35,528 WARN L233 SmtUtils]: Spent 10.09s on a formula simplification that was a NOOP. DAG size: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:11:47,570 WARN L233 SmtUtils]: Spent 10.02s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:11:47,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:47,845 INFO L93 Difference]: Finished difference Result 367 states and 484 transitions. [2022-07-12 11:11:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 11:11:47,846 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.869565217391304) internal successors, (89), 25 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 50 [2022-07-12 11:11:47,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:47,847 INFO L225 Difference]: With dead ends: 367 [2022-07-12 11:11:47,847 INFO L226 Difference]: Without dead ends: 206 [2022-07-12 11:11:47,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 96 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 99.6s TimeCoverageRelationStatistics Valid=199, Invalid=1420, Unknown=21, NotChecked=0, Total=1640 [2022-07-12 11:11:47,852 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 161 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:47,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 993 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 205 Invalid, 0 Unknown, 169 Unchecked, 0.2s Time] [2022-07-12 11:11:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-12 11:11:47,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 146. [2022-07-12 11:11:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 114 states have (on average 1.2543859649122806) internal successors, (143), 119 states have internal predecessors, (143), 17 states have call successors, (17), 11 states have call predecessors, (17), 14 states have return successors, (26), 15 states have call predecessors, (26), 16 states have call successors, (26) [2022-07-12 11:11:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 186 transitions. [2022-07-12 11:11:47,866 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 186 transitions. Word has length 50 [2022-07-12 11:11:47,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:47,867 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 186 transitions. [2022-07-12 11:11:47,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.869565217391304) internal successors, (89), 25 states have internal predecessors, (89), 10 states have call successors, (12), 4 states have call predecessors, (12), 7 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-07-12 11:11:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 186 transitions. [2022-07-12 11:11:47,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 11:11:47,868 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:47,868 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 11:11:47,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 11:11:48,075 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,SelfDestructingSolverStorable14 [2022-07-12 11:11:48,076 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:48,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:48,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2080562516, now seen corresponding path program 2 times [2022-07-12 11:11:48,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:48,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267005818] [2022-07-12 11:11:48,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:48,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:11:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:11:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:11:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 11:11:48,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:48,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267005818] [2022-07-12 11:11:48,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267005818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:48,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:11:48,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 11:11:48,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613661574] [2022-07-12 11:11:48,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:48,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 11:11:48,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:48,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 11:11:48,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 11:11:48,272 INFO L87 Difference]: Start difference. First operand 146 states and 186 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 11:11:48,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:48,455 INFO L93 Difference]: Finished difference Result 266 states and 345 transitions. [2022-07-12 11:11:48,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 11:11:48,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-07-12 11:11:48,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:48,457 INFO L225 Difference]: With dead ends: 266 [2022-07-12 11:11:48,457 INFO L226 Difference]: Without dead ends: 167 [2022-07-12 11:11:48,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-07-12 11:11:48,458 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 25 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:48,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 374 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:11:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-12 11:11:48,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2022-07-12 11:11:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 119 states have (on average 1.2436974789915967) internal successors, (148), 125 states have internal predecessors, (148), 17 states have call successors, (17), 11 states have call predecessors, (17), 16 states have return successors, (29), 16 states have call predecessors, (29), 16 states have call successors, (29) [2022-07-12 11:11:48,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 194 transitions. [2022-07-12 11:11:48,473 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 194 transitions. Word has length 52 [2022-07-12 11:11:48,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:48,473 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 194 transitions. [2022-07-12 11:11:48,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-07-12 11:11:48,474 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 194 transitions. [2022-07-12 11:11:48,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-12 11:11:48,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:48,474 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 11:11:48,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 11:11:48,475 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:48,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:48,475 INFO L85 PathProgramCache]: Analyzing trace with hash 48376912, now seen corresponding path program 1 times [2022-07-12 11:11:48,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:48,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138432146] [2022-07-12 11:11:48,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:48,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:11:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:11:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-12 11:11:48,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-12 11:11:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:48,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138432146] [2022-07-12 11:11:48,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138432146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:48,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:11:48,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 11:11:48,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607853013] [2022-07-12 11:11:48,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:48,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 11:11:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:48,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 11:11:48,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:11:48,595 INFO L87 Difference]: Start difference. First operand 153 states and 194 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 11:11:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:48,623 INFO L93 Difference]: Finished difference Result 263 states and 338 transitions. [2022-07-12 11:11:48,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 11:11:48,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 52 [2022-07-12 11:11:48,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:48,625 INFO L225 Difference]: With dead ends: 263 [2022-07-12 11:11:48,625 INFO L226 Difference]: Without dead ends: 137 [2022-07-12 11:11:48,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 11:11:48,626 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:48,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 250 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 11:11:48,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-12 11:11:48,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2022-07-12 11:11:48,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 104 states have (on average 1.2211538461538463) internal successors, (127), 106 states have internal predecessors, (127), 15 states have call successors, (15), 11 states have call predecessors, (15), 12 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-12 11:11:48,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 162 transitions. [2022-07-12 11:11:48,638 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 162 transitions. Word has length 52 [2022-07-12 11:11:48,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:48,638 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 162 transitions. [2022-07-12 11:11:48,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-12 11:11:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 162 transitions. [2022-07-12 11:11:48,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-12 11:11:48,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:48,639 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:48,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 11:11:48,639 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:48,640 INFO L85 PathProgramCache]: Analyzing trace with hash -41969126, now seen corresponding path program 1 times [2022-07-12 11:11:48,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:48,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835770578] [2022-07-12 11:11:48,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:48,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-07-12 11:11:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-12 11:11:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-12 11:11:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 11:11:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:48,879 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 11:11:48,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:48,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835770578] [2022-07-12 11:11:48,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835770578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:48,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:11:48,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:11:48,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501396222] [2022-07-12 11:11:48,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:48,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:11:48,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:48,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:11:48,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:11:48,881 INFO L87 Difference]: Start difference. First operand 132 states and 162 transitions. Second operand has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 11:11:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:49,080 INFO L93 Difference]: Finished difference Result 138 states and 167 transitions. [2022-07-12 11:11:49,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 11:11:49,081 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-07-12 11:11:49,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:49,082 INFO L225 Difference]: With dead ends: 138 [2022-07-12 11:11:49,082 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 11:11:49,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2022-07-12 11:11:49,082 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 16 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:49,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 502 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 11:11:49,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 11:11:49,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-12 11:11:49,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 106 states have (on average 1.2075471698113207) internal successors, (128), 107 states have internal predecessors, (128), 15 states have call successors, (15), 12 states have call predecessors, (15), 12 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-12 11:11:49,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2022-07-12 11:11:49,091 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 58 [2022-07-12 11:11:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:49,092 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2022-07-12 11:11:49,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 6 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-07-12 11:11:49,092 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2022-07-12 11:11:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 11:11:49,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:49,093 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:49,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 11:11:49,093 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:49,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:49,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1239716043, now seen corresponding path program 1 times [2022-07-12 11:11:49,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:49,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661551295] [2022-07-12 11:11:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:49,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:49,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:49,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:49,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:11:49,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:11:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:11:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:11:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 11:11:49,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:49,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661551295] [2022-07-12 11:11:49,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661551295] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 11:11:49,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 11:11:49,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 11:11:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904543863] [2022-07-12 11:11:49,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 11:11:49,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 11:11:49,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:11:49,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 11:11:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-12 11:11:49,406 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 11:11:49,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:11:49,790 INFO L93 Difference]: Finished difference Result 143 states and 173 transitions. [2022-07-12 11:11:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 11:11:49,791 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 78 [2022-07-12 11:11:49,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:11:49,792 INFO L225 Difference]: With dead ends: 143 [2022-07-12 11:11:49,792 INFO L226 Difference]: Without dead ends: 136 [2022-07-12 11:11:49,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-07-12 11:11:49,793 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 63 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 11:11:49,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 90 Invalid, 498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 11:11:49,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-12 11:11:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-07-12 11:11:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 108 states have (on average 1.1944444444444444) internal successors, (129), 109 states have internal predecessors, (129), 15 states have call successors, (15), 12 states have call predecessors, (15), 12 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2022-07-12 11:11:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 164 transitions. [2022-07-12 11:11:49,807 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 164 transitions. Word has length 78 [2022-07-12 11:11:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:11:49,807 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 164 transitions. [2022-07-12 11:11:49,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 7 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-12 11:11:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 164 transitions. [2022-07-12 11:11:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 11:11:49,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:11:49,808 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:11:49,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 11:11:49,809 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:11:49,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:11:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash -2049062669, now seen corresponding path program 1 times [2022-07-12 11:11:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:11:49,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629775820] [2022-07-12 11:11:49,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:49,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:11:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:11:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:49,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:49,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:11:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:50,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:11:50,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:50,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:11:50,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:50,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:11:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:50,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:11:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:50,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:11:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:50,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:11:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:50,438 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-12 11:11:50,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:11:50,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629775820] [2022-07-12 11:11:50,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629775820] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:11:50,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1757909704] [2022-07-12 11:11:50,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:11:50,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:11:50,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:11:50,444 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:11:50,445 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:11:50,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:11:50,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-12 11:11:50,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:11:50,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:11:50,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:11:50,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:11:50,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:11:50,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:11:50,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:11:50,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-12 11:11:53,214 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 9 treesize of output 5 [2022-07-12 11:12:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 5 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-12 11:12:08,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:12:08,739 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 10 treesize of output 6 [2022-07-12 11:12:08,939 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 10 treesize of output 6 [2022-07-12 11:12:11,265 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 10 treesize of output 6 [2022-07-12 11:12:11,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1757909704] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:12:11,335 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 11:12:11,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 39 [2022-07-12 11:12:11,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316703835] [2022-07-12 11:12:11,335 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 11:12:11,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-12 11:12:11,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:12:11,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-12 11:12:11,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2367, Unknown=2, NotChecked=0, Total=2550 [2022-07-12 11:12:11,337 INFO L87 Difference]: Start difference. First operand 136 states and 164 transitions. Second operand has 39 states, 33 states have (on average 3.121212121212121) internal successors, (103), 34 states have internal predecessors, (103), 14 states have call successors, (18), 6 states have call predecessors, (18), 10 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) [2022-07-12 11:12:34,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:12:34,233 INFO L93 Difference]: Finished difference Result 244 states and 303 transitions. [2022-07-12 11:12:34,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 11:12:34,233 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 33 states have (on average 3.121212121212121) internal successors, (103), 34 states have internal predecessors, (103), 14 states have call successors, (18), 6 states have call predecessors, (18), 10 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) Word has length 78 [2022-07-12 11:12:34,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:12:34,235 INFO L225 Difference]: With dead ends: 244 [2022-07-12 11:12:34,235 INFO L226 Difference]: Without dead ends: 237 [2022-07-12 11:12:34,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 116 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1548 ImplicationChecksByTransitivity, 42.3s TimeCoverageRelationStatistics Valid=450, Invalid=6189, Unknown=3, NotChecked=0, Total=6642 [2022-07-12 11:12:34,238 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 115 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:12:34,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 775 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 875 Invalid, 0 Unknown, 459 Unchecked, 0.5s Time] [2022-07-12 11:12:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-12 11:12:34,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 169. [2022-07-12 11:12:34,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 135 states have (on average 1.1777777777777778) internal successors, (159), 139 states have internal predecessors, (159), 17 states have call successors, (17), 15 states have call predecessors, (17), 16 states have return successors, (24), 14 states have call predecessors, (24), 16 states have call successors, (24) [2022-07-12 11:12:34,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2022-07-12 11:12:34,256 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 78 [2022-07-12 11:12:34,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:12:34,256 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2022-07-12 11:12:34,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 33 states have (on average 3.121212121212121) internal successors, (103), 34 states have internal predecessors, (103), 14 states have call successors, (18), 6 states have call predecessors, (18), 10 states have return successors, (17), 10 states have call predecessors, (17), 13 states have call successors, (17) [2022-07-12 11:12:34,256 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2022-07-12 11:12:34,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 11:12:34,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:12:34,257 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 11:12:34,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-12 11:12:34,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:12:34,482 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:12:34,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:12:34,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1852877617, now seen corresponding path program 1 times [2022-07-12 11:12:34,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:12:34,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288392336] [2022-07-12 11:12:34,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:12:34,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:12:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:34,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:12:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:34,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:12:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:34,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:12:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:34,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:12:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:34,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:12:34,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:34,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:12:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:34,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:12:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:34,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:12:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:34,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:12:34,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-07-12 11:12:34,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:12:34,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288392336] [2022-07-12 11:12:34,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288392336] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:12:34,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971556494] [2022-07-12 11:12:34,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:12:34,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:12:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:12:34,956 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:12:34,957 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:12:35,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:35,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-12 11:12:35,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:12:36,111 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 11:12:36,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:12:36,597 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-12 11:12:36,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:12:36,605 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-12 11:12:36,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 11:12:36,729 INFO L356 Elim1Store]: treesize reduction 8, result has 46.7 percent of original size [2022-07-12 11:12:36,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2022-07-12 11:12:36,735 INFO L356 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2022-07-12 11:12:36,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-12 11:12:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 11:12:36,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971556494] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:12:36,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:12:36,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 13] total 35 [2022-07-12 11:12:36,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869073963] [2022-07-12 11:12:36,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:12:36,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 11:12:36,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:12:36,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 11:12:36,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1055, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 11:12:36,752 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand has 35 states, 32 states have (on average 3.53125) internal successors, (113), 31 states have internal predecessors, (113), 11 states have call successors, (23), 5 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2022-07-12 11:12:37,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:12:37,657 INFO L93 Difference]: Finished difference Result 234 states and 275 transitions. [2022-07-12 11:12:37,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 11:12:37,658 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 3.53125) internal successors, (113), 31 states have internal predecessors, (113), 11 states have call successors, (23), 5 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) Word has length 78 [2022-07-12 11:12:37,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:12:37,659 INFO L225 Difference]: With dead ends: 234 [2022-07-12 11:12:37,659 INFO L226 Difference]: Without dead ends: 227 [2022-07-12 11:12:37,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 146 SyntacticMatches, 10 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=379, Invalid=2071, Unknown=0, NotChecked=0, Total=2450 [2022-07-12 11:12:37,661 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 239 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 987 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 11:12:37,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 342 Invalid, 987 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 677 Invalid, 0 Unknown, 261 Unchecked, 0.4s Time] [2022-07-12 11:12:37,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-07-12 11:12:37,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 195. [2022-07-12 11:12:37,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 157 states have (on average 1.1847133757961783) internal successors, (186), 161 states have internal predecessors, (186), 18 states have call successors, (18), 17 states have call predecessors, (18), 19 states have return successors, (26), 16 states have call predecessors, (26), 17 states have call successors, (26) [2022-07-12 11:12:37,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 230 transitions. [2022-07-12 11:12:37,683 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 230 transitions. Word has length 78 [2022-07-12 11:12:37,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:12:37,683 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 230 transitions. [2022-07-12 11:12:37,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 3.53125) internal successors, (113), 31 states have internal predecessors, (113), 11 states have call successors, (23), 5 states have call predecessors, (23), 9 states have return successors, (23), 10 states have call predecessors, (23), 10 states have call successors, (23) [2022-07-12 11:12:37,684 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 230 transitions. [2022-07-12 11:12:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 11:12:37,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:12:37,684 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:12:37,703 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:12:37,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:12:37,892 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:12:37,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:12:37,892 INFO L85 PathProgramCache]: Analyzing trace with hash 2111043055, now seen corresponding path program 1 times [2022-07-12 11:12:37,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:12:37,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658857425] [2022-07-12 11:12:37,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:12:37,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:12:37,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:37,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:12:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:38,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:12:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:38,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:12:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:38,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:12:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:12:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:12:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:12:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:38,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:12:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:38,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:12:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-07-12 11:12:38,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:12:38,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658857425] [2022-07-12 11:12:38,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658857425] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:12:38,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484297069] [2022-07-12 11:12:38,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:12:38,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:12:38,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:12:38,204 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:12:38,227 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:12:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:38,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-12 11:12:38,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:12:39,307 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|) 0))) (exists ((|v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9| Int) (|v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_is_valid_#in~list#1.base_BEFORE_CALL_9|) |v_aws_linked_list_is_valid_#in~list#1.offset_BEFORE_CALL_9|) 0)))) is different from true [2022-07-12 11:12:40,200 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_22| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_22| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_22|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_22|) 0))) (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_22| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_22| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_22|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_22|) 0)))) is different from true [2022-07-12 11:12:41,051 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23|) 0))) (exists ((|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23| Int) (|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_23|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_23|) 0)))) is different from true [2022-07-12 11:12:41,899 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24|) 0))) (exists ((|v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24| Int) (|v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_aws_linked_list_init_#in~list.base_BEFORE_CALL_24|) |v_aws_linked_list_init_#in~list.offset_BEFORE_CALL_24|) 0)))) is different from true [2022-07-12 11:12:42,362 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2022-07-12 11:12:42,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:12:43,035 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:12:43,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-12 11:12:43,045 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-12 11:12:43,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-07-12 11:12:43,154 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-12 11:12:43,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-12 11:12:43,159 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-12 11:12:43,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-07-12 11:12:43,169 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-12 11:12:43,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484297069] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 11:12:43,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 11:12:43,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 21, 13] total 39 [2022-07-12 11:12:43,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287065145] [2022-07-12 11:12:43,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 11:12:43,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-12 11:12:43,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 11:12:43,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-12 11:12:43,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1073, Unknown=4, NotChecked=276, Total=1482 [2022-07-12 11:12:43,172 INFO L87 Difference]: Start difference. First operand 195 states and 230 transitions. Second operand has 39 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 12 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-12 11:12:56,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 11:12:56,266 INFO L93 Difference]: Finished difference Result 261 states and 324 transitions. [2022-07-12 11:12:56,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 11:12:56,267 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 12 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) Word has length 78 [2022-07-12 11:12:56,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 11:12:56,268 INFO L225 Difference]: With dead ends: 261 [2022-07-12 11:12:56,268 INFO L226 Difference]: Without dead ends: 254 [2022-07-12 11:12:56,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 147 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 723 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=392, Invalid=2922, Unknown=8, NotChecked=460, Total=3782 [2022-07-12 11:12:56,270 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 165 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 861 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 743 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 11:12:56,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 268 Invalid, 1648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 861 Invalid, 0 Unknown, 743 Unchecked, 0.5s Time] [2022-07-12 11:12:56,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-07-12 11:12:56,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 207. [2022-07-12 11:12:56,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 167 states have (on average 1.1976047904191616) internal successors, (200), 170 states have internal predecessors, (200), 19 states have call successors, (19), 18 states have call predecessors, (19), 20 states have return successors, (28), 18 states have call predecessors, (28), 18 states have call successors, (28) [2022-07-12 11:12:56,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 247 transitions. [2022-07-12 11:12:56,290 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 247 transitions. Word has length 78 [2022-07-12 11:12:56,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 11:12:56,290 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 247 transitions. [2022-07-12 11:12:56,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 35 states have (on average 3.4285714285714284) internal successors, (120), 34 states have internal predecessors, (120), 12 states have call successors, (23), 8 states have call predecessors, (23), 12 states have return successors, (23), 11 states have call predecessors, (23), 11 states have call successors, (23) [2022-07-12 11:12:56,290 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 247 transitions. [2022-07-12 11:12:56,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 11:12:56,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 11:12:56,292 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 11:12:56,316 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:12:56,505 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,SelfDestructingSolverStorable21 [2022-07-12 11:12:56,505 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 11:12:56,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 11:12:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1310004315, now seen corresponding path program 1 times [2022-07-12 11:12:56,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 11:12:56,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495713382] [2022-07-12 11:12:56,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:12:56,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 11:12:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 11:12:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:56,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:12:56,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:56,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-12 11:12:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:56,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:12:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:56,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-12 11:12:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:56,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-12 11:12:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:56,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 11:12:56,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 11:12:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:56,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-12 11:12:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:57,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-12 11:12:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:57,103 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-07-12 11:12:57,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 11:12:57,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495713382] [2022-07-12 11:12:57,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495713382] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 11:12:57,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146972180] [2022-07-12 11:12:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 11:12:57,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 11:12:57,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 11:12:57,105 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:12:57,107 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:12:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 11:12:57,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 121 conjunts are in the unsatisfiable core [2022-07-12 11:12:57,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 11:12:57,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-12 11:12:57,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 11:12:57,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 35 [2022-07-12 11:13:07,466 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 25 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 11:13:07,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 11:13:21,080 WARN L233 SmtUtils]: Spent 10.17s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:13:33,534 WARN L233 SmtUtils]: Spent 10.36s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:13:46,108 WARN L233 SmtUtils]: Spent 11.58s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:14:02,563 WARN L233 SmtUtils]: Spent 10.28s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-12 11:14:17,184 WARN L233 SmtUtils]: Spent 10.41s on a formula simplification that was a NOOP. DAG size: 36 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)